/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/loop-acceleration/simple_3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:24:56,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:24:56,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:24:56,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:24:56,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:24:56,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:24:56,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:24:56,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:24:56,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:24:56,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:24:56,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:24:56,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:24:56,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:24:56,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:24:56,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:24:56,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:24:56,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:24:56,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:24:56,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:24:56,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:24:56,880 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:24:56,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:24:56,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:24:56,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:24:56,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:24:56,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:24:56,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:24:56,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:24:56,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:24:56,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:24:56,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:24:56,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:24:56,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:24:56,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:24:56,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:24:56,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:24:56,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:24:56,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:24:56,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:24:56,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:24:56,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:24:56,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:24:56,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:24:56,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:24:56,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:24:56,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:24:56,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:24:56,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:24:56,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:24:56,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:24:56,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:24:56,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:24:56,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:24:56,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:24:56,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:24:56,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:24:56,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:24:56,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:24:56,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:24:56,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:24:56,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:24:56,917 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:24:56,917 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:24:56,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:24:56,917 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:24:56,918 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:24:57,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:24:57,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:24:57,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:24:57,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:24:57,175 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:24:57,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-08 09:24:57,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42553abaa/fb78db61371b405395bce351623a692c/FLAG2a23e2f63 [2022-04-08 09:24:57,608 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:24:57,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-08 09:24:57,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42553abaa/fb78db61371b405395bce351623a692c/FLAG2a23e2f63 [2022-04-08 09:24:58,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42553abaa/fb78db61371b405395bce351623a692c [2022-04-08 09:24:58,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:24:58,028 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:24:58,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:24:58,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:24:58,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:24:58,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d545ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58, skipping insertion in model container [2022-04-08 09:24:58,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:24:58,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:24:58,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c[376,389] [2022-04-08 09:24:58,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:24:58,248 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:24:58,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c[376,389] [2022-04-08 09:24:58,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:24:58,284 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:24:58,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58 WrapperNode [2022-04-08 09:24:58,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:24:58,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:24:58,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:24:58,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:24:58,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:24:58,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:24:58,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:24:58,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:24:58,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (1/1) ... [2022-04-08 09:24:58,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:24:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:24:58,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:24:58,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:24:58,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:24:58,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:24:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:24:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:24:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:24:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:24:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:24:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:24:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:24:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-08 09:24:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:24:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:24:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:24:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:24:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:24:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:24:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:24:58,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:24:58,453 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:24:58,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:24:58,571 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:24:58,579 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:24:58,579 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:24:58,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:24:58 BoogieIcfgContainer [2022-04-08 09:24:58,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:24:58,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:24:58,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:24:58,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:24:58,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:24:58" (1/3) ... [2022-04-08 09:24:58,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224bad0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:24:58, skipping insertion in model container [2022-04-08 09:24:58,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:24:58" (2/3) ... [2022-04-08 09:24:58,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224bad0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:24:58, skipping insertion in model container [2022-04-08 09:24:58,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:24:58" (3/3) ... [2022-04-08 09:24:58,588 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_3-2.c [2022-04-08 09:24:58,592 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:24:58,592 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:24:58,640 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:24:58,647 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:24:58,648 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:24:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:24:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:24:58,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:24:58,678 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:24:58,679 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:24:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:24:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 1 times [2022-04-08 09:24:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:24:58,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [471510434] [2022-04-08 09:24:58,699 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:24:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 2 times [2022-04-08 09:24:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:24:58,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032707528] [2022-04-08 09:24:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:24:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:24:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:24:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:24:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:24:58,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-08 09:24:58,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:24:58,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-08 09:24:58,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:24:58,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-08 09:24:58,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:24:58,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-08 09:24:58,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-08 09:24:58,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {26#(= main_~x~0 0)} is VALID [2022-04-08 09:24:58,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {26#(= main_~x~0 0)} is VALID [2022-04-08 09:24:58,953 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:24:58,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:24:58,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22#false} is VALID [2022-04-08 09:24:58,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-08 09:24:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:24:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:24:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032707528] [2022-04-08 09:24:58,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032707528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:24:58,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:24:58,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:24:58,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:24:58,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [471510434] [2022-04-08 09:24:58,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [471510434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:24:58,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:24:58,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:24:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148986370] [2022-04-08 09:24:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:24:58,964 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-08 09:24:58,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:24:58,968 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-08 09:24:58,983 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-08 09:24:58,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:24:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:24:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:24:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:24:59,021 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.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-08 09:24:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:24:59,283 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 09:24:59,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:24:59,284 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-08 09:24:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:24:59,285 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-08 09:24:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 09:24:59,293 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-08 09:24:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 09:24:59,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 09:24:59,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:24:59,373 INFO L225 Difference]: With dead ends: 37 [2022-04-08 09:24:59,373 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 09:24:59,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:24:59,378 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:24:59,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:24:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 09:24:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 09:24:59,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:24:59,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:24:59,415 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:24:59,416 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:24:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:24:59,421 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:24:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:24:59,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:24:59,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:24:59,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 09:24:59,424 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 09:24:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:24:59,430 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:24:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:24:59,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:24:59,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:24:59,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:24:59,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:24:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:24:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 09:24:59,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 09:24:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:24:59,435 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 09:24:59,435 INFO L479 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-08 09:24:59,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 09:24:59,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:24:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:24:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:24:59,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:24:59,454 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:24:59,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:24:59,457 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:24:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:24:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1718713523, now seen corresponding path program 1 times [2022-04-08 09:24:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:24:59,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990210130] [2022-04-08 09:24:59,481 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:24:59,481 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:24:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1718713523, now seen corresponding path program 2 times [2022-04-08 09:24:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:24:59,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962402456] [2022-04-08 09:24:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:24:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:24:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:24:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:24:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:24:59,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(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(13, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-04-08 09:24:59,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-08 09:24:59,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #36#return; {166#true} is VALID [2022-04-08 09:24:59,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:24:59,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#(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(13, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-04-08 09:24:59,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-08 09:24:59,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} #36#return; {166#true} is VALID [2022-04-08 09:24:59,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} call #t~ret5 := main(); {166#true} is VALID [2022-04-08 09:24:59,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {171#(= main_~x~0 0)} is VALID [2022-04-08 09:24:59,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296);~x~0 := 2 + ~x~0; {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} is VALID [2022-04-08 09:24:59,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} is VALID [2022-04-08 09:24:59,611 INFO L272 TraceCheckUtils]: 8: Hoare triple {172#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {173#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:24:59,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {174#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:24:59,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {167#false} is VALID [2022-04-08 09:24:59,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-08 09:24:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:24:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:24:59,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962402456] [2022-04-08 09:24:59,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962402456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:24:59,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058521720] [2022-04-08 09:24:59,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:24:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:24:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:24:59,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:24:59,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:24:59,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:24:59,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:24:59,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:24:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:24:59,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:24:59,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {166#true} is VALID [2022-04-08 09:24:59,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#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(13, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-04-08 09:24:59,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-08 09:24:59,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} #36#return; {166#true} is VALID [2022-04-08 09:24:59,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} call #t~ret5 := main(); {166#true} is VALID [2022-04-08 09:24:59,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {171#(= main_~x~0 0)} is VALID [2022-04-08 09:24:59,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296);~x~0 := 2 + ~x~0; {197#(= (+ (- 2) main_~x~0) 0)} is VALID [2022-04-08 09:24:59,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(= (+ (- 2) main_~x~0) 0)} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {197#(= (+ (- 2) main_~x~0) 0)} is VALID [2022-04-08 09:24:59,857 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#(= (+ (- 2) main_~x~0) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:24:59,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:24:59,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {167#false} is VALID [2022-04-08 09:24:59,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-08 09:24:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:24:59,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:24:59,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-08 09:24:59,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {167#false} is VALID [2022-04-08 09:24:59,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:24:59,973 INFO L272 TraceCheckUtils]: 8: Hoare triple {224#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:24:59,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {224#(= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:24:59,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296);~x~0 := 2 + ~x~0; {224#(= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:24:59,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {224#(= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:24:59,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} call #t~ret5 := main(); {166#true} is VALID [2022-04-08 09:24:59,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} #36#return; {166#true} is VALID [2022-04-08 09:24:59,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-08 09:24:59,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#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(13, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-04-08 09:24:59,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {166#true} is VALID [2022-04-08 09:24:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:24:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058521720] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 09:24:59,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:24:59,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 11 [2022-04-08 09:24:59,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:24:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990210130] [2022-04-08 09:24:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990210130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:24:59,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:24:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:24:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48803211] [2022-04-08 09:24:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:24:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:24:59,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:24:59,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:24:59,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:24:59,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:24:59,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:24:59,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:24:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:24:59,992 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:00,047 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:25:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:25:00,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:25:00,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-08 09:25:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-08 09:25:00,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 12 transitions. [2022-04-08 09:25:00,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:00,069 INFO L225 Difference]: With dead ends: 13 [2022-04-08 09:25:00,069 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:25:00,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:25:00,074 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:00,077 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:25:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:25:00,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:00,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:00,079 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:00,079 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:00,080 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:25:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:25:00,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:00,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:00,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:25:00,080 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:25:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:00,080 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:25:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:25:00,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:00,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:00,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:00,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:25:00,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-08 09:25:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:00,086 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:25:00,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:00,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:25:00,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:25:00,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:00,093 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:25:00,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:25:00,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:00,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:25:00,410 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 09:25:00,411 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 09:25:00,411 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 09:25:00,411 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 22) the Hoare annotation is: true [2022-04-08 09:25:00,411 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 22) the Hoare annotation is: true [2022-04-08 09:25:00,411 INFO L878 garLoopResultBuilder]: At program point L17-2(lines 17 19) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-08 09:25:00,411 INFO L878 garLoopResultBuilder]: At program point L17-3(lines 17 19) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-08 09:25:00,411 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 22) the Hoare annotation is: true [2022-04-08 09:25:00,411 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:25:00,412 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:25:00,412 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:25:00,412 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:25:00,412 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:25:00,412 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:25:00,412 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:25:00,412 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-08 09:25:00,412 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:25:00,412 INFO L878 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:25:00,413 INFO L878 garLoopResultBuilder]: At program point L7(lines 7 9) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 09:25:00,413 INFO L878 garLoopResultBuilder]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:25:00,413 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:25:00,416 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-08 09:25:00,417 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:25:00,420 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:25:00,422 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:25:00,426 INFO L163 areAnnotationChecker]: CFG has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:25:00,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:25:00 BoogieIcfgContainer [2022-04-08 09:25:00,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:25:00,434 INFO L158 Benchmark]: Toolchain (without parser) took 2405.88ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 128.4MB in the beginning and 163.0MB in the end (delta: -34.6MB). Peak memory consumption was 2.0MB. Max. memory is 8.0GB. [2022-04-08 09:25:00,435 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 144.6MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:25:00,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.57ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 156.3MB in the end (delta: -28.1MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-08 09:25:00,435 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 176.2MB. Free memory was 156.3MB in the beginning and 154.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:25:00,436 INFO L158 Benchmark]: RCFGBuilder took 262.38ms. Allocated memory is still 176.2MB. Free memory was 154.9MB in the beginning and 144.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:25:00,436 INFO L158 Benchmark]: TraceAbstraction took 1850.70ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 144.0MB in the beginning and 163.0MB in the end (delta: -19.0MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2022-04-08 09:25:00,438 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.19ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 144.6MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.57ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 156.3MB in the end (delta: -28.1MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 176.2MB. Free memory was 156.3MB in the beginning and 154.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 262.38ms. Allocated memory is still 176.2MB. Free memory was 154.9MB in the beginning and 144.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1850.70ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 144.0MB in the beginning and 163.0MB in the end (delta: -19.0MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 20 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 30 PreInvPairs, 43 NumberOfFragments, 66 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: x % 2 == 0 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 09:25:00,468 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...