/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/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:42:31,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:42:31,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:42:31,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:42:31,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:42:31,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:42:31,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:42:31,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:42:31,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:42:31,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:42:31,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:42:31,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:42:31,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:42:31,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:42:31,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:42:31,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:42:31,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:42:31,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:42:31,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:42:31,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:42:31,958 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:42:31,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:42:31,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:42:31,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:42:31,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:42:31,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:42:31,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:42:31,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:42:31,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:42:31,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:42:31,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:42:31,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:42:31,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:42:31,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:42:31,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:42:31,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:42:31,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:42:31,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:42:31,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:42:31,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:42:31,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:42:31,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:42:31,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:42:31,983 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:42:31,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:42:31,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:42:31,984 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:42:31,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:42:31,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:42:31,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:42:31,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:42:31,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:42:31,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:42:31,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:42:31,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:42:31,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:42:31,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:42:31,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:31,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:42:31,986 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:42:31,986 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-28 02:42:32,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:42:32,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:42:32,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:42:32,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:42:32,212 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:42:32,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-28 02:42:32,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3dc3e09/69765c97f1034ae58fdd7478199d99b9/FLAG4c57c317b [2022-04-28 02:42:32,605 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:42:32,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-28 02:42:32,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3dc3e09/69765c97f1034ae58fdd7478199d99b9/FLAG4c57c317b [2022-04-28 02:42:32,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3dc3e09/69765c97f1034ae58fdd7478199d99b9 [2022-04-28 02:42:32,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:42:32,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:42:32,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:32,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:42:32,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:42:32,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b948103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32, skipping insertion in model container [2022-04-28 02:42:32,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:42:32,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:42:32,783 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/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-28 02:42:32,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:32,795 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:42:32,803 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/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-28 02:42:32,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:32,815 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:42:32,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32 WrapperNode [2022-04-28 02:42:32,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:32,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:42:32,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:42:32,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:42:32,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:42:32,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:42:32,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:42:32,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:42:32,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (1/1) ... [2022-04-28 02:42:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:32,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:32,859 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-28 02:42:32,865 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-28 02:42:32,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:42:32,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:42:32,911 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:42:32,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:42:32,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:42:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:42:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:42:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:42:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:42:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:42:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:42:32,965 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:42:32,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:42:33,112 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:42:33,116 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:42:33,117 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:42:33,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:33 BoogieIcfgContainer [2022-04-28 02:42:33,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:42:33,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:42:33,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:42:33,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:42:33,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:42:32" (1/3) ... [2022-04-28 02:42:33,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f42a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:33, skipping insertion in model container [2022-04-28 02:42:33,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:32" (2/3) ... [2022-04-28 02:42:33,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f42a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:33, skipping insertion in model container [2022-04-28 02:42:33,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:33" (3/3) ... [2022-04-28 02:42:33,139 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2022-04-28 02:42:33,148 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:42:33,148 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:42:33,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:42:33,213 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c0e249, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@109af5da [2022-04-28 02:42:33,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:42:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-28 02:42:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:42:33,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:33,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:33,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-28 02:42:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707398171] [2022-04-28 02:42:33,250 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-28 02:42:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:33,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102303828] [2022-04-28 02:42:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#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(36, 2); {23#true} is VALID [2022-04-28 02:42:33,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:33,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 02:42:33,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:33,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#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(36, 2); {23#true} is VALID [2022-04-28 02:42:33,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:33,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 02:42:33,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-28 02:42:33,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-28 02:42:33,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 02:42:33,418 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-28 02:42:33,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 02:42:33,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 02:42:33,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 02:42:33,419 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-28 02:42:33,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102303828] [2022-04-28 02:42:33,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102303828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:33,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:33,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:42:33,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:33,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707398171] [2022-04-28 02:42:33,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707398171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:33,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:33,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:42:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114499099] [2022-04-28 02:42:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:33,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 02:42:33,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:33,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:42:33,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:42:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:42:33,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:42:33,469 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:42:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,539 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 02:42:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:42:33,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 02:42:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:42:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 02:42:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:42:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 02:42:33,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-28 02:42:33,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,598 INFO L225 Difference]: With dead ends: 31 [2022-04-28 02:42:33,599 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 02:42:33,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:42:33,605 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:33,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 02:42:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 02:42:33,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:33,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) 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-28 02:42:33,629 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) 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-28 02:42:33,629 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) 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-28 02:42:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,634 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 02:42:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:42:33,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:33,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:33,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) 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) Second operand 14 states. [2022-04-28 02:42:33,635 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) 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) Second operand 14 states. [2022-04-28 02:42:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,637 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 02:42:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:42:33,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:33,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:33,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:33,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) 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-28 02:42:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 02:42:33,639 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 02:42:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:33,640 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 02:42:33,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:42:33,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 02:42:33,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:42:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:42:33,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:33,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:33,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:42:33,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-28 02:42:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507353646] [2022-04-28 02:42:33,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-28 02:42:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:33,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441465263] [2022-04-28 02:42:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(and (= |#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(36, 2); {149#true} is VALID [2022-04-28 02:42:33,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 02:42:33,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-28 02:42:33,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:33,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(and (= |#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(36, 2); {149#true} is VALID [2022-04-28 02:42:33,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 02:42:33,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-28 02:42:33,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2022-04-28 02:42:33,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 02:42:33,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 02:42:33,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {155#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:33,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {156#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:33,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-28 02:42:33,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-28 02:42:33,795 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-28 02:42:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:33,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441465263] [2022-04-28 02:42:33,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441465263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:33,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:33,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:33,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507353646] [2022-04-28 02:42:33,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507353646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:33,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:33,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:33,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240993234] [2022-04-28 02:42:33,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-28 02:42:33,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:33,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 02:42:33,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:42:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:42:33,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:33,815 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 02:42:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,916 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 02:42:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:42:33,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-28 02:42:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 02:42:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 02:42:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 02:42:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 02:42:33,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-28 02:42:33,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,945 INFO L225 Difference]: With dead ends: 20 [2022-04-28 02:42:33,945 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:42:33,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:42:33,948 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:33,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:42:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 02:42:33,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:33,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:33,952 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:33,952 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,953 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:42:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:42:33,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:33,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:33,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:42:33,954 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:42:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,955 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:42:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:42:33,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:33,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:33,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:33,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 02:42:33,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 02:42:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:33,956 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 02:42:33,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-28 02:42:33,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 02:42:33,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:42:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:42:33,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:33,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:33,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:42:33,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-28 02:42:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493129087] [2022-04-28 02:42:34,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:34,260 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash -994786162, now seen corresponding path program 1 times [2022-04-28 02:42:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:34,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126517765] [2022-04-28 02:42:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:34,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:34,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#(and (= |#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(36, 2); {266#true} is VALID [2022-04-28 02:42:34,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-28 02:42:34,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-28 02:42:34,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:34,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#(and (= |#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(36, 2); {266#true} is VALID [2022-04-28 02:42:34,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-28 02:42:34,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-28 02:42:34,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret3 := main(); {266#true} is VALID [2022-04-28 02:42:34,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {266#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {271#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:42:34,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [51] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_11 v_main_~i~0_10)) (.cse1 (= |v_main_#t~post2_4| |v_main_#t~post2_3|)) (.cse2 (<= v_main_~i~0_11 v_main_~n~0_6)) (.cse3 (= v_main_~i~0_11 4))) (or (and (= v_main_~n~0_6 v_main_~n~0_6) .cse0 .cse1 (= v_main_~sn~0_10 v_main_~sn~0_7)) (and (= v_main_~sn~0_7 v_main_~sn~0_10) .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse2 (<= v_main_~i~0_10 5) (< v_main_~i~0_11 v_main_~i~0_10) (= (+ v_main_~sn~0_7 10) 0) .cse3))) InVars {main_~i~0=v_main_~i~0_11, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_6, main_~sn~0=v_main_~sn~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_6, main_~sn~0=v_main_~sn~0_7} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {272#(= main_~sn~0 0)} is VALID [2022-04-28 02:42:34,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(= main_~sn~0 0)} [50] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {272#(= main_~sn~0 0)} is VALID [2022-04-28 02:42:34,319 INFO L272 TraceCheckUtils]: 8: Hoare triple {272#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:34,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {274#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:34,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {274#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {267#false} is VALID [2022-04-28 02:42:34,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-04-28 02:42:34,320 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-28 02:42:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:34,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126517765] [2022-04-28 02:42:34,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126517765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:34,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:34,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:42:34,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:34,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493129087] [2022-04-28 02:42:34,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493129087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:34,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:34,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:42:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13775897] [2022-04-28 02:42:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) 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-28 02:42:34,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:34,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) 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-28 02:42:34,362 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-28 02:42:34,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:42:34,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:34,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:42:34,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:42:34,363 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) 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-28 02:42:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:34,485 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 02:42:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) 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-28 02:42:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) 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-28 02:42:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 02:42:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) 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-28 02:42:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 02:42:34,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 02:42:34,508 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-28 02:42:34,508 INFO L225 Difference]: With dead ends: 25 [2022-04-28 02:42:34,509 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 02:42:34,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:42:34,509 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:34,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 02:42:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 02:42:34,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:34,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-28 02:42:34,513 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-28 02:42:34,514 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-28 02:42:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:34,514 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 02:42:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 02:42:34,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:34,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:34,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-28 02:42:34,515 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-28 02:42:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:34,516 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 02:42:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 02:42:34,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:34,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:34,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:34,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-28 02:42:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 02:42:34,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-28 02:42:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:34,517 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 02:42:34,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) 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-28 02:42:34,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 02:42:34,532 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-28 02:42:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 02:42:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:42:34,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:34,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:34,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:42:34,533 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:34,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 1 times [2022-04-28 02:42:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:34,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90268140] [2022-04-28 02:42:36,679 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:42:36,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:36,811 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash -935680818, now seen corresponding path program 1 times [2022-04-28 02:42:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:36,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445096564] [2022-04-28 02:42:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:36,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {409#(and (= |#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(36, 2); {399#true} is VALID [2022-04-28 02:42:36,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume true; {399#true} is VALID [2022-04-28 02:42:36,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {399#true} {399#true} #47#return; {399#true} is VALID [2022-04-28 02:42:36,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:36,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {409#(and (= |#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(36, 2); {399#true} is VALID [2022-04-28 02:42:36,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2022-04-28 02:42:36,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #47#return; {399#true} is VALID [2022-04-28 02:42:36,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret3 := main(); {399#true} is VALID [2022-04-28 02:42:36,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {404#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:42:36,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [53] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse1 (= v_main_~i~0_17 v_main_~i~0_16)) (.cse2 (= v_main_~sn~0_17 v_main_~sn~0_16)) (.cse3 (= v_main_~i~0_17 4))) (or (and .cse0 .cse1 (= v_main_~n~0_8 v_main_~n~0_8) .cse2) (and .cse0 .cse1 (or (not (<= v_main_~i~0_17 v_main_~n~0_8)) .cse3) .cse2) (and (or (not (<= 5 v_main_~i~0_16)) (not (<= v_main_~i~0_17 3))) (not .cse3) (<= v_main_~i~0_16 (+ v_main_~n~0_8 1)) (< v_main_~i~0_17 v_main_~i~0_16) (= (+ (* v_main_~i~0_16 2) v_main_~sn~0_17) (+ (* v_main_~i~0_17 2) v_main_~sn~0_16))))) InVars {main_~i~0=v_main_~i~0_17, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_8, main_~sn~0=v_main_~sn~0_17} OutVars{main_~i~0=v_main_~i~0_16, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_8, main_~sn~0=v_main_~sn~0_16} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {405#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:42:36,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {406#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:36,913 INFO L272 TraceCheckUtils]: 8: Hoare triple {406#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {407#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:36,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {407#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {408#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:36,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {400#false} is VALID [2022-04-28 02:42:36,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {400#false} assume !false; {400#false} is VALID [2022-04-28 02:42:36,915 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-28 02:42:36,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:36,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445096564] [2022-04-28 02:42:36,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445096564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:36,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:36,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:42:37,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:37,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90268140] [2022-04-28 02:42:37,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90268140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:37,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:37,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:42:37,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946081713] [2022-04-28 02:42:37,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:37,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-28 02:42:37,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:37,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-28 02:42:37,113 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-28 02:42:37,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:42:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:37,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:42:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:42:37,114 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-28 02:42:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,458 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 02:42:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:42:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-28 02:42:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-28 02:42:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-28 02:42:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-28 02:42:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-28 02:42:37,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2022-04-28 02:42:37,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:37,482 INFO L225 Difference]: With dead ends: 24 [2022-04-28 02:42:37,482 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 02:42:37,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:42:37,483 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:37,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 02:42:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 02:42:37,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:37,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-28 02:42:37,495 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-28 02:42:37,495 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-28 02:42:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,496 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 02:42:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:42:37,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:37,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:37,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-28 02:42:37,496 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-28 02:42:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,497 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 02:42:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:42:37,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:37,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:37,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:37,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-28 02:42:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 02:42:37,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-28 02:42:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:37,498 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 02:42:37,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-28 02:42:37,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 02:42:37,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:42:37,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:42:37,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:37,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:37,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:42:37,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 1 times [2022-04-28 02:42:37,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:37,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [574816381] [2022-04-28 02:42:40,732 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:42:40,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:41,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:41,108 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1591374445, now seen corresponding path program 1 times [2022-04-28 02:42:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:41,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704721947] [2022-04-28 02:42:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:41,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:42:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:41,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:42:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 2 times [2022-04-28 02:42:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:41,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803107517] [2022-04-28 02:42:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:41,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#(and (= |#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(36, 2); {554#true} is VALID [2022-04-28 02:42:41,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 02:42:41,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-28 02:42:41,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:41,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#(and (= |#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(36, 2); {554#true} is VALID [2022-04-28 02:42:41,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 02:42:41,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-28 02:42:41,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret3 := main(); {554#true} is VALID [2022-04-28 02:42:41,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {559#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 02:42:41,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {559#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {559#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 02:42:41,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {559#(= (+ (- 1) main_~i~0) 0)} assume !(4 == ~i~0); {559#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 02:42:41,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {559#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {560#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:41,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {560#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {560#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:41,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {560#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {555#false} is VALID [2022-04-28 02:42:41,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {555#false} is VALID [2022-04-28 02:42:41,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !(~i~0 <= ~n~0); {555#false} is VALID [2022-04-28 02:42:41,252 INFO L272 TraceCheckUtils]: 13: Hoare triple {555#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {555#false} is VALID [2022-04-28 02:42:41,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-04-28 02:42:41,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-04-28 02:42:41,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-28 02:42:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:41,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803107517] [2022-04-28 02:42:41,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803107517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:41,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18020732] [2022-04-28 02:42:41,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:42:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:41,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:41,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 02:42:41,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:42:41,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:41,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 02:42:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:41,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:41,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-28 02:42:41,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {554#true} is VALID [2022-04-28 02:42:41,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 02:42:41,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-28 02:42:41,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret3 := main(); {554#true} is VALID [2022-04-28 02:42:41,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {580#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:41,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {580#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {580#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:41,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#(<= main_~i~0 1)} assume !(4 == ~i~0); {580#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:41,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {560#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:41,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {560#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {560#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:41,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {560#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {555#false} is VALID [2022-04-28 02:42:41,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {555#false} is VALID [2022-04-28 02:42:41,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !(~i~0 <= ~n~0); {555#false} is VALID [2022-04-28 02:42:41,411 INFO L272 TraceCheckUtils]: 13: Hoare triple {555#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {555#false} is VALID [2022-04-28 02:42:41,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-04-28 02:42:41,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-04-28 02:42:41,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-28 02:42:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:41,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:41,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-28 02:42:41,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-04-28 02:42:41,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-04-28 02:42:41,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {555#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {555#false} is VALID [2022-04-28 02:42:41,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !(~i~0 <= ~n~0); {555#false} is VALID [2022-04-28 02:42:41,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {555#false} is VALID [2022-04-28 02:42:41,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {632#(not (<= 4 main_~i~0))} assume 4 == ~i~0;~sn~0 := -10; {555#false} is VALID [2022-04-28 02:42:41,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {632#(not (<= 4 main_~i~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {632#(not (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:41,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {560#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {632#(not (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:41,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {560#(<= main_~i~0 2)} assume !(4 == ~i~0); {560#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:41,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {560#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {560#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:41,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {560#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:41,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret3 := main(); {554#true} is VALID [2022-04-28 02:42:41,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-28 02:42:41,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 02:42:41,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {554#true} is VALID [2022-04-28 02:42:41,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-28 02:42:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:41,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18020732] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:41,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:41,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 02:42:41,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:41,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [574816381] [2022-04-28 02:42:41,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [574816381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:41,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:41,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:41,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905118460] [2022-04-28 02:42:41,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:41,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 02:42:41,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:41,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 02:42:41,493 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-28 02:42:41,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:42:41,493 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 02:42:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,559 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 02:42:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:41,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 02:42:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 02:42:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 02:42:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 02:42:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 02:42:41,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 02:42:41,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:41,587 INFO L225 Difference]: With dead ends: 31 [2022-04-28 02:42:41,587 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 02:42:41,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:42:41,589 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:41,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 02:42:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 02:42:41,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:41,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:42:41,608 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:42:41,609 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:42:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,611 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 02:42:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 02:42:41,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:41,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:41,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 23 states. [2022-04-28 02:42:41,612 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 23 states. [2022-04-28 02:42:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,615 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 02:42:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 02:42:41,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:41,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:41,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:41,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:42:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-28 02:42:41,618 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-28 02:42:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:41,618 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-28 02:42:41,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 02:42:41,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-28 02:42:41,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 02:42:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:42:41,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:41,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:41,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:41,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 02:42:41,855 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 3 times [2022-04-28 02:42:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:41,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819046895] [2022-04-28 02:42:42,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:42,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:42,277 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash -654060691, now seen corresponding path program 1 times [2022-04-28 02:42:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:42,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142202361] [2022-04-28 02:42:42,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:42,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:42:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:42,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:42:42,320 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 4 times [2022-04-28 02:42:42,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:42,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430864083] [2022-04-28 02:42:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {829#(and (= |#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(36, 2); {821#true} is VALID [2022-04-28 02:42:42,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 02:42:42,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-28 02:42:42,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:42,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#(and (= |#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(36, 2); {821#true} is VALID [2022-04-28 02:42:42,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 02:42:42,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-28 02:42:42,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret3 := main(); {821#true} is VALID [2022-04-28 02:42:42,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {826#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 02:42:42,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {826#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 02:42:42,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#(= (+ (- 1) main_~i~0) 0)} assume !(4 == ~i~0); {826#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 02:42:42,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(<= main_~i~0 2)} assume !(4 == ~i~0); {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {828#(<= main_~i~0 3)} is VALID [2022-04-28 02:42:42,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {828#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {828#(<= main_~i~0 3)} is VALID [2022-04-28 02:42:42,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {822#false} is VALID [2022-04-28 02:42:42,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {822#false} is VALID [2022-04-28 02:42:42,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#false} assume !(~i~0 <= ~n~0); {822#false} is VALID [2022-04-28 02:42:42,388 INFO L272 TraceCheckUtils]: 16: Hoare triple {822#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {822#false} is VALID [2022-04-28 02:42:42,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2022-04-28 02:42:42,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2022-04-28 02:42:42,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-28 02:42:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:42,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430864083] [2022-04-28 02:42:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430864083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:42,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286949826] [2022-04-28 02:42:42,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:42:42,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:42,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:42,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 02:42:42,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:42:42,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:42,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 02:42:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:42,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2022-04-28 02:42:42,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {821#true} is VALID [2022-04-28 02:42:42,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 02:42:42,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-28 02:42:42,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret3 := main(); {821#true} is VALID [2022-04-28 02:42:42,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {848#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:42,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:42,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} assume !(4 == ~i~0); {848#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:42,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(<= main_~i~0 2)} assume !(4 == ~i~0); {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {828#(<= main_~i~0 3)} is VALID [2022-04-28 02:42:42,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {828#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {828#(<= main_~i~0 3)} is VALID [2022-04-28 02:42:42,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {822#false} is VALID [2022-04-28 02:42:42,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {822#false} is VALID [2022-04-28 02:42:42,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#false} assume !(~i~0 <= ~n~0); {822#false} is VALID [2022-04-28 02:42:42,512 INFO L272 TraceCheckUtils]: 16: Hoare triple {822#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {822#false} is VALID [2022-04-28 02:42:42,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2022-04-28 02:42:42,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2022-04-28 02:42:42,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-28 02:42:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:42,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:42,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-28 02:42:42,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2022-04-28 02:42:42,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2022-04-28 02:42:42,580 INFO L272 TraceCheckUtils]: 16: Hoare triple {822#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {822#false} is VALID [2022-04-28 02:42:42,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#false} assume !(~i~0 <= ~n~0); {822#false} is VALID [2022-04-28 02:42:42,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {822#false} is VALID [2022-04-28 02:42:42,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {822#false} is VALID [2022-04-28 02:42:42,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {828#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {828#(<= main_~i~0 3)} is VALID [2022-04-28 02:42:42,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {828#(<= main_~i~0 3)} is VALID [2022-04-28 02:42:42,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(<= main_~i~0 2)} assume !(4 == ~i~0); {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {827#(<= main_~i~0 2)} is VALID [2022-04-28 02:42:42,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} assume !(4 == ~i~0); {848#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:42,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:42,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {848#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:42,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret3 := main(); {821#true} is VALID [2022-04-28 02:42:42,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-28 02:42:42,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 02:42:42,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {821#true} is VALID [2022-04-28 02:42:42,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2022-04-28 02:42:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:42,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286949826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:42,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:42,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-28 02:42:42,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:42,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819046895] [2022-04-28 02:42:42,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819046895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:42,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:42,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425726484] [2022-04-28 02:42:42,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:42,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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 20 [2022-04-28 02:42:42,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:42,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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-28 02:42:42,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:42,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:42:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:42:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:42:42,598 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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-28 02:42:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:42,691 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 02:42:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:42:42,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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 20 [2022-04-28 02:42:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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-28 02:42:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-28 02:42:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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-28 02:42:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-28 02:42:42,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-28 02:42:42,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:42,734 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:42:42,734 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:42:42,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:42:42,735 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:42,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:42:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 02:42:42,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:42,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:42:42,761 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:42:42,761 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:42:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:42,762 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:42:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:42:42,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:42,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:42,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-28 02:42:42,763 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-28 02:42:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:42,763 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:42:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:42:42,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:42,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:42,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:42,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:42:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 02:42:42,765 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-28 02:42:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:42,765 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 02:42:42,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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-28 02:42:42,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 02:42:42,791 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-28 02:42:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 02:42:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:42:42,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:42,792 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:42,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:43,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2022-04-28 02:42:43,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 5 times [2022-04-28 02:42:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:43,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247743302] [2022-04-28 02:42:43,220 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:43,431 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:43,432 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1395471469, now seen corresponding path program 1 times [2022-04-28 02:42:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:43,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791492786] [2022-04-28 02:42:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:43,448 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:42:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:43,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:42:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 6 times [2022-04-28 02:42:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:43,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169275342] [2022-04-28 02:42:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:43,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:42:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:42:43,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:42:43,504 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 02:42:43,505 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 02:42:43,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:42:43,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9 [2022-04-28 02:42:43,509 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:43,511 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-28 02:42:43,518 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 02:42:43,519 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:42:43,519 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:42:43,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:42:43 BoogieIcfgContainer [2022-04-28 02:42:43,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:42:43,520 INFO L158 Benchmark]: Toolchain (without parser) took 10897.71ms. Allocated memory was 192.9MB in the beginning and 278.9MB in the end (delta: 86.0MB). Free memory was 141.6MB in the beginning and 183.9MB in the end (delta: -42.3MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,520 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 192.9MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:42:43,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.17ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 141.4MB in the beginning and 205.8MB in the end (delta: -64.5MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,521 INFO L158 Benchmark]: Boogie Preprocessor took 17.41ms. Allocated memory is still 231.7MB. Free memory was 205.8MB in the beginning and 204.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:42:43,521 INFO L158 Benchmark]: RCFGBuilder took 283.37ms. Allocated memory is still 231.7MB. Free memory was 204.7MB in the beginning and 193.8MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,521 INFO L158 Benchmark]: TraceAbstraction took 10400.71ms. Allocated memory was 231.7MB in the beginning and 278.9MB in the end (delta: 47.2MB). Free memory was 193.3MB in the beginning and 183.9MB in the end (delta: 9.3MB). Peak memory consumption was 58.1MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,522 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.08ms. Allocated memory is still 192.9MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.17ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 141.4MB in the beginning and 205.8MB in the end (delta: -64.5MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.41ms. Allocated memory is still 231.7MB. Free memory was 205.8MB in the beginning and 204.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 283.37ms. Allocated memory is still 231.7MB. Free memory was 204.7MB in the beginning and 193.8MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10400.71ms. Allocated memory was 231.7MB in the beginning and 278.9MB in the end (delta: 47.2MB). Free memory was 193.3MB in the beginning and 183.9MB in the end (delta: 9.3MB). Peak memory consumption was 58.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND TRUE i==4 [L26] sn=-10 [L24] i++ [L24] COND FALSE !(i<=n) [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 77 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 02:42:43,535 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...