/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:47:26,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:47:26,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:47:26,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:47:26,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:47:26,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:47:26,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:47:26,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:47:26,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:47:26,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:47:26,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:47:26,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:47:26,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:47:26,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:47:26,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:47:26,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:47:26,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:47:26,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:47:26,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:47:26,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:47:26,955 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:47:26,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:47:26,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:47:26,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:47:26,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:47:26,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:47:26,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:47:26,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:47:26,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:47:26,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:47:26,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:47:26,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:47:26,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:47:26,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:47:26,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:47:26,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:47:26,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:47:26,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:47:26,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:47:26,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:47:26,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:47:26,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:47:26,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:47:26,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:47:26,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:47:26,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:47:26,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:47:26,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:47:26,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:47:26,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:47:26,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:47:26,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:47:26,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:47:26,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:47:26,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:47:26,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:47:26,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:47:26,981 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:47:27,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:47:27,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:47:27,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:47:27,197 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:47:27,198 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:47:27,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-15 12:47:27,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4768537a/667cfe6295d74bdfb95f024571f4ca66/FLAGe156c3f47 [2022-04-15 12:47:27,535 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:47:27,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-15 12:47:27,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4768537a/667cfe6295d74bdfb95f024571f4ca66/FLAGe156c3f47 [2022-04-15 12:47:27,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4768537a/667cfe6295d74bdfb95f024571f4ca66 [2022-04-15 12:47:27,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:47:27,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:47:27,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:47:27,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:47:27,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:47:27,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600747fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27, skipping insertion in model container [2022-04-15 12:47:27,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:47:27,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:47:27,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c[406,419] [2022-04-15 12:47:27,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:47:27,751 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:47:27,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c[406,419] [2022-04-15 12:47:27,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:47:27,782 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:47:27,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27 WrapperNode [2022-04-15 12:47:27,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:47:27,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:47:27,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:47:27,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:47:27,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:47:27,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:47:27,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:47:27,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:47:27,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (1/1) ... [2022-04-15 12:47:27,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:47:27,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:27,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:47:27,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:47:27,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:47:27,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:47:27,876 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:47:27,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:47:27,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:47:27,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:47:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:47:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:47:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:47:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:47:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:47:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:47:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:47:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:47:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:47:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:47:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:47:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:47:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:47:27,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:47:27,923 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:47:27,925 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:47:28,037 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:47:28,062 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:47:28,062 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:47:28,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:47:28 BoogieIcfgContainer [2022-04-15 12:47:28,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:47:28,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:47:28,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:47:28,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:47:28,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:47:27" (1/3) ... [2022-04-15 12:47:28,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9d5a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:47:28, skipping insertion in model container [2022-04-15 12:47:28,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:27" (2/3) ... [2022-04-15 12:47:28,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9d5a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:47:28, skipping insertion in model container [2022-04-15 12:47:28,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:47:28" (3/3) ... [2022-04-15 12:47:28,081 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.c [2022-04-15 12:47:28,084 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:47:28,084 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:47:28,110 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:47:28,115 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:47:28,115 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:47:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:47:28,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:28,140 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:28,140 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:28,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 1 times [2022-04-15 12:47:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:28,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085472295] [2022-04-15 12:47:28,166 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:47:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 2 times [2022-04-15 12:47:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243514666] [2022-04-15 12:47:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:28,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-15 12:47:28,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:47:28,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 12:47:28,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:28,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-15 12:47:28,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:47:28,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 12:47:28,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-15 12:47:28,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {25#true} is VALID [2022-04-15 12:47:28,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {30#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:47:28,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(and (= main_~j~0 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:47:28,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-15 12:47:28,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} assume ~n~0 % 4294967296 > 0; {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-15 12:47:28,627 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:47:28,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:28,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-15 12:47:28,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 12:47:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:28,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243514666] [2022-04-15 12:47:28,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243514666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:28,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:28,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:47:28,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:28,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085472295] [2022-04-15 12:47:28,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085472295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:28,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:28,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:47:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397874016] [2022-04-15 12:47:28,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:28,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:47:28,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:28,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:28,656 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-15 12:47:28,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:47:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:47:28,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:47:28,679 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:33,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:37,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:39,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:41,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:43,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:45,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:45,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:45,791 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-15 12:47:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:47:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:47:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-15 12:47:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-15 12:47:45,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2022-04-15 12:47:45,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:45,972 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:47:45,972 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:47:45,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:47:45,975 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:45,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 14.7s Time] [2022-04-15 12:47:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:47:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-15 12:47:46,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:46,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:46,003 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:46,003 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:46,006 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 12:47:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 12:47:46,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:46,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:46,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 12:47:46,007 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 12:47:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:46,009 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 12:47:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 12:47:46,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:46,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:46,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:46,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 12:47:46,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-15 12:47:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:46,012 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 12:47:46,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:46,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 12:47:46,054 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-15 12:47:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 12:47:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:47:46,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:46,055 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:46,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:47:46,056 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash -244126219, now seen corresponding path program 1 times [2022-04-15 12:47:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:46,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [646016644] [2022-04-15 12:47:46,370 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1655658973, now seen corresponding path program 1 times [2022-04-15 12:47:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:46,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995599502] [2022-04-15 12:47:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:46,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {260#true} is VALID [2022-04-15 12:47:46,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-15 12:47:46,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} #61#return; {260#true} is VALID [2022-04-15 12:47:46,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {272#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:46,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {260#true} is VALID [2022-04-15 12:47:46,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-15 12:47:46,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #61#return; {260#true} is VALID [2022-04-15 12:47:46,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret5 := main(); {260#true} is VALID [2022-04-15 12:47:46,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {260#true} is VALID [2022-04-15 12:47:46,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {265#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:47:46,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(and (= main_~j~0 0) (= main_~i~0 0))} [65] L28-->L24_primed: Formula: (or (and (= v_main_~j~0_In_1 v_main_~j~0_Out_2) (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~i~0_In_1 v_main_~i~0_Out_2)) (let ((.cse0 (mod v_main_~n~0_In_1 4294967296))) (and (< (mod (+ v_main_~i~0_Out_2 4294967293) 4294967296) .cse0) (= (mod (+ (* 2 v_main_~j~0_In_1) v_main_~j~0_Out_2) 3) 0) (<= 0 (div (+ (* (- 1) v_main_~j~0_In_1) v_main_~j~0_Out_2) 3)) (= (* v_main_~n~0_In_1 3) 0) (<= .cse0 0) (not (= 0 (mod v_main_~i~0_Out_2 2))) (= (+ (* (- 3) v_main_~j~0_Out_2) (* v_main_~i~0_Out_2 3)) (+ (* v_main_~i~0_In_1 3) (* v_main_~j~0_In_1 (- 3))))))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~j~0=v_main_~j~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_~n~0=v_main_~n~0_In_1, main_~j~0=v_main_~j~0_Out_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {266#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (and (= main_~j~0 0) (= main_~i~0 0)))} is VALID [2022-04-15 12:47:46,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (and (= main_~j~0 0) (= main_~i~0 0)))} [64] L24_primed-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {267#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3)))} is VALID [2022-04-15 12:47:46,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3)))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {268#(or (and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2))) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:47:46,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {268#(or (and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2))) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} assume ~n~0 % 4294967296 > 0; {269#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-15 12:47:46,667 INFO L272 TraceCheckUtils]: 11: Hoare triple {269#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {270#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:47:46,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {271#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:46,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {261#false} is VALID [2022-04-15 12:47:46,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-04-15 12:47:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:46,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:46,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995599502] [2022-04-15 12:47:46,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995599502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:46,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:46,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:47:46,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:46,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [646016644] [2022-04-15 12:47:46,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [646016644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:46,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:46,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:47:46,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392712585] [2022-04-15 12:47:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:47:46,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:46,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:47:46,783 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-15 12:47:46,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:47:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:46,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:47:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:47:46,784 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:47:49,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:51,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:53,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:55,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:57,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:57,633 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 12:47:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:47:57,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:47:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:47:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-15 12:47:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:47:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-15 12:47:57,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-15 12:47:57,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:57,682 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:47:57,682 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:47:57,682 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:47:57,683 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:57,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 5 Unknown, 0 Unchecked, 10.5s Time] [2022-04-15 12:47:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:47:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 12:47:57,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:57,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:57,695 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:57,695 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:57,697 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:47:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:47:57,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:57,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:57,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:47:57,698 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:47:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:57,699 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:47:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:47:57,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:57,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:57,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:57,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:47:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-15 12:47:57,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2022-04-15 12:47:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:57,701 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-15 12:47:57,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:47:57,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-15 12:47:57,729 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-15 12:47:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 12:47:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:47:57,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:57,730 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:57,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:47:57,730 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 722095884, now seen corresponding path program 1 times [2022-04-15 12:47:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:57,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670817206] [2022-04-15 12:48:56,946 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1673647587, now seen corresponding path program 1 times [2022-04-15 12:48:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604506837] [2022-04-15 12:48:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:57,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {467#true} is VALID [2022-04-15 12:48:57,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-15 12:48:57,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {467#true} {467#true} #61#return; {467#true} is VALID [2022-04-15 12:48:57,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {479#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:57,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {467#true} is VALID [2022-04-15 12:48:57,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-15 12:48:57,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #61#return; {467#true} is VALID [2022-04-15 12:48:57,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret5 := main(); {467#true} is VALID [2022-04-15 12:48:57,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {467#true} is VALID [2022-04-15 12:48:57,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {472#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:48:57,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#(and (= main_~j~0 0) (= main_~i~0 0))} [67] L28-->L24_primed: Formula: (or (let ((.cse0 (mod v_main_~n~0_In_2 4294967296))) (and (<= (mod (div (mod v_main_~i~0_Out_4 4294967296) 2) 4294967296) (mod v_main_~j~0_Out_4 4294967296)) (= (+ (* (- 3) v_main_~j~0_Out_4) (* v_main_~i~0_Out_4 3)) (+ (* v_main_~j~0_In_2 (- 3)) (* v_main_~i~0_In_2 3))) (= (* v_main_~n~0_In_2 3) 0) (not (= (mod v_main_~i~0_Out_4 2) 0)) (<= 0 (div (+ (* (- 1) v_main_~j~0_In_2) v_main_~j~0_Out_4) 3)) (< 0 .cse0) (= (mod (+ (* 2 v_main_~j~0_In_2) v_main_~j~0_Out_4) 3) 0) (< (mod (+ v_main_~i~0_Out_4 4294967293) 4294967296) .cse0))) (and (= v_main_~n~0_In_2 v_main_~n~0_In_2) (= v_main_~j~0_In_2 v_main_~j~0_Out_4) (= v_main_~i~0_In_2 v_main_~i~0_Out_4))) InVars {main_~i~0=v_main_~i~0_In_2, main_~n~0=v_main_~n~0_In_2, main_~j~0=v_main_~j~0_In_2} OutVars{main_~i~0=v_main_~i~0_Out_4, main_~n~0=v_main_~n~0_In_2, main_~j~0=v_main_~j~0_Out_4} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {473#(or (and (<= main_~i~0 (* main_~j~0 2)) (<= (+ (* main_~j~0 2) main_~i~0) 0) (<= 0 main_~i~0)) (and (< 0 (+ (div main_~n~0 4294967296) 1)) (<= main_~n~0 0)))} is VALID [2022-04-15 12:48:57,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#(or (and (<= main_~i~0 (* main_~j~0 2)) (<= (+ (* main_~j~0 2) main_~i~0) 0) (<= 0 main_~i~0)) (and (< 0 (+ (div main_~n~0 4294967296) 1)) (<= main_~n~0 0)))} [66] L24_primed-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {474#(or (and (<= (+ (* main_~j~0 2) main_~i~0) (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 8589934592) 4294967299 (* (div main_~i~0 4294967296) 4294967296))) (<= main_~i~0 (+ (* main_~j~0 2) 3)) (not (<= (+ (div main_~i~0 4294967296) 1) 0))) (and (< 0 (+ (div main_~n~0 4294967296) 1)) (<= main_~n~0 0)))} is VALID [2022-04-15 12:48:57,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#(or (and (<= (+ (* main_~j~0 2) main_~i~0) (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 8589934592) 4294967299 (* (div main_~i~0 4294967296) 4294967296))) (<= main_~i~0 (+ (* main_~j~0 2) 3)) (not (<= (+ (div main_~i~0 4294967296) 1) 0))) (and (< 0 (+ (div main_~n~0 4294967296) 1)) (<= main_~n~0 0)))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {475#(or (and (<= (+ main_~i~0 3) (* main_~j~0 2)) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (< (div main_~j~0 4294967296) (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1))) (and (< 0 (+ (div main_~n~0 4294967296) 1)) (<= main_~n~0 0)))} is VALID [2022-04-15 12:48:57,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {475#(or (and (<= (+ main_~i~0 3) (* main_~j~0 2)) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (< (div main_~j~0 4294967296) (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1))) (and (< 0 (+ (div main_~n~0 4294967296) 1)) (<= main_~n~0 0)))} assume ~n~0 % 4294967296 > 0; {476#(and (<= (+ main_~i~0 3) (* main_~j~0 2)) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (< (div main_~j~0 4294967296) (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1)))} is VALID [2022-04-15 12:48:57,353 INFO L272 TraceCheckUtils]: 11: Hoare triple {476#(and (<= (+ main_~i~0 3) (* main_~j~0 2)) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (< (div main_~j~0 4294967296) (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1)))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {477#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:57,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {477#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {478#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:57,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {478#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {468#false} is VALID [2022-04-15 12:48:57,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#false} assume !false; {468#false} is VALID [2022-04-15 12:48:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:57,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:57,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604506837] [2022-04-15 12:48:57,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604506837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:57,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:57,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:49:07,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:07,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670817206] [2022-04-15 12:49:07,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670817206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:07,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:07,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:49:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880561483] [2022-04-15 12:49:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:07,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-15 12:49:07,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:07,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:49:07,999 WARN L143 InductivityCheck]: Transition 484#(<= (mod (div (mod main_~i~0 4294967296) 2) 4294967296) (mod main_~j~0 4294967296)) ( _ , assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; , 474#(or (and (<= (+ (* main_~j~0 2) main_~i~0) (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 8589934592) 4294967299 (* (div main_~i~0 4294967296) 4294967296))) (<= main_~i~0 (+ (* main_~j~0 2) 3)) (not (<= (+ (div main_~i~0 4294967296) 1) 0))) (and (< 0 (+ (div main_~n~0 4294967296) 1)) (<= main_~n~0 0))) ) not inductive [2022-04-15 12:49:08,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:49:08,000 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:49:08,003 INFO L158 Benchmark]: Toolchain (without parser) took 100451.55ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 133.1MB in the beginning and 181.7MB in the end (delta: -48.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:49:08,003 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:49:08,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.40ms. Allocated memory is still 181.4MB. Free memory was 133.0MB in the beginning and 157.8MB in the end (delta: -24.8MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-15 12:49:08,004 INFO L158 Benchmark]: Boogie Preprocessor took 30.47ms. Allocated memory is still 181.4MB. Free memory was 157.8MB in the beginning and 156.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:49:08,004 INFO L158 Benchmark]: RCFGBuilder took 253.17ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 145.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:49:08,004 INFO L158 Benchmark]: TraceAbstraction took 99932.84ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 145.2MB in the beginning and 181.7MB in the end (delta: -36.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-15 12:49:08,005 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.11ms. Allocated memory is still 181.4MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.40ms. Allocated memory is still 181.4MB. Free memory was 133.0MB in the beginning and 157.8MB in the end (delta: -24.8MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.47ms. Allocated memory is still 181.4MB. Free memory was 157.8MB in the beginning and 156.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 253.17ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 145.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 99932.84ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 145.2MB in the beginning and 181.7MB in the end (delta: -36.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:49:08,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...