/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:39:54,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:39:54,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:39:54,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:39:54,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:39:54,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:39:54,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:39:54,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:39:54,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:39:54,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:39:54,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:39:54,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:39:54,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:39:54,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:39:54,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:39:54,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:39:54,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:39:54,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:39:54,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:39:54,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:39:54,513 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:39:54,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:39:54,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:39:54,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:39:54,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:39:54,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:39:54,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:39:54,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:39:54,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:39:54,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:39:54,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:39:54,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:39:54,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:39:54,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:39:54,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:39:54,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:39:54,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:39:54,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:39:54,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:39:54,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:39:54,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:39:54,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:39:54,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:39:54,569 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:39:54,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:39:54,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:39:54,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:39:54,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:39:54,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:39:54,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:39:54,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:39:54,572 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:39:54,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:39:54,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:39:54,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:39:54,574 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:39:54,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:39:54,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:39:54,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:39:54,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:39:54,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:39:54,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:39:54,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:39:54,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:39:54,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:39:54,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:39:54,575 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:39:54,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:39:54,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:39:54,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:39:54,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:39:54,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:39:54,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:39:54,813 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:39:54,814 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:39:54,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_2-2.c [2022-04-27 10:39:54,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308304bf2/eb61458b255a4c9d920115cdf2511ff0/FLAGbff62459d [2022-04-27 10:39:55,231 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:39:55,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-2.c [2022-04-27 10:39:55,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308304bf2/eb61458b255a4c9d920115cdf2511ff0/FLAGbff62459d [2022-04-27 10:39:55,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308304bf2/eb61458b255a4c9d920115cdf2511ff0 [2022-04-27 10:39:55,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:39:55,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:39:55,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:39:55,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:39:55,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:39:55,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d23cf91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55, skipping insertion in model container [2022-04-27 10:39:55,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:39:55,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:39:55,496 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/underapprox_2-2.c[327,340] [2022-04-27 10:39:55,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:39:55,520 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:39:55,529 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/underapprox_2-2.c[327,340] [2022-04-27 10:39:55,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:39:55,540 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:39:55,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55 WrapperNode [2022-04-27 10:39:55,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:39:55,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:39:55,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:39:55,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:39:55,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:39:55,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:39:55,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:39:55,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:39:55,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (1/1) ... [2022-04-27 10:39:55,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:39:55,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:55,600 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-27 10:39:55,604 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-27 10:39:55,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:39:55,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:39:55,636 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:39:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:39:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:39:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:39:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:39:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:39:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:39:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:39:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:39:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:39:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:39:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:39:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:39:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:39:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:39:55,688 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:39:55,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:39:55,760 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:39:55,766 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:39:55,766 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:39:55,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:55 BoogieIcfgContainer [2022-04-27 10:39:55,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:39:55,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:39:55,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:39:55,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:39:55,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:39:55" (1/3) ... [2022-04-27 10:39:55,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c06f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:55, skipping insertion in model container [2022-04-27 10:39:55,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:55" (2/3) ... [2022-04-27 10:39:55,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c06f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:55, skipping insertion in model container [2022-04-27 10:39:55,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:55" (3/3) ... [2022-04-27 10:39:55,774 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_2-2.c [2022-04-27 10:39:55,785 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:39:55,786 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:39:55,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:39:55,829 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e19daa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a6a25f9 [2022-04-27 10:39:55,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:39:55,841 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-27 10:39:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:39:55,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:55,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:55,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-27 10:39:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:55,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540134576] [2022-04-27 10:39:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:39:56,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:39:56,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:39:56,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:56,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:39:56,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:39:56,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:39:56,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-27 10:39:56,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-27 10:39:56,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-27 10:39:56,096 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-27 10:39:56,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-27 10:39:56,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-27 10:39:56,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:39:56,097 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-27 10:39:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:56,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540134576] [2022-04-27 10:39:56,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540134576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:39:56,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:39:56,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:39:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766937455] [2022-04-27 10:39:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:39:56,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:56,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:56,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:56,134 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-27 10:39:56,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:39:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:56,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:39:56,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:39:56,158 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:56,241 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 10:39:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:39:56,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:39:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:39:56,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 10:39:56,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:56,314 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:39:56,315 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 10:39:56,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:39:56,322 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:56,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:39:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 10:39:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 10:39:56,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:56,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-27 10:39:56,351 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-27 10:39:56,352 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-27 10:39:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:56,357 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:39:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:56,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:56,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:56,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-27 10:39:56,358 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-27 10:39:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:56,360 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:39:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:56,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:56,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:56,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:56,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-27 10:39:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 10:39:56,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 10:39:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:56,365 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 10:39:56,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:39:56,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:56,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:56,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:39:56,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:56,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-27 10:39:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:56,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041393110] [2022-04-27 10:39:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:56,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(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(18, 2);call #Ultimate.allocInit(12, 3); {110#true} is VALID [2022-04-27 10:39:56,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:39:56,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:39:56,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} call ULTIMATE.init(); {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:56,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(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(18, 2);call #Ultimate.allocInit(12, 3); {110#true} is VALID [2022-04-27 10:39:56,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:39:56,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:39:56,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} call #t~ret5 := main(); {110#true} is VALID [2022-04-27 10:39:56,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} ~x~0 := 0;~y~0 := 1; {115#(= main_~x~0 0)} is VALID [2022-04-27 10:39:56,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {111#false} is VALID [2022-04-27 10:39:56,524 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {111#false} is VALID [2022-04-27 10:39:56,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} ~cond := #in~cond; {111#false} is VALID [2022-04-27 10:39:56,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#false} assume 0 == ~cond; {111#false} is VALID [2022-04-27 10:39:56,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-04-27 10:39:56,524 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-27 10:39:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:56,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041393110] [2022-04-27 10:39:56,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041393110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:39:56,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:39:56,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:39:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103984834] [2022-04-27 10:39:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:39:56,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:39:56,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:56,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:39:56,541 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-27 10:39:56,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:39:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:39:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:39:56,542 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:39:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:56,593 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:39:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:39:56,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:39:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:39:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:39:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:39:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:39:56,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 10:39:56,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:56,623 INFO L225 Difference]: With dead ends: 18 [2022-04-27 10:39:56,623 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:39:56,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:39:56,624 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:56,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:39:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:39:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:39:56,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:56,628 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-27 10:39:56,628 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-27 10:39:56,628 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-27 10:39:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:56,629 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:39:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:56,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:56,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:56,630 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-27 10:39:56,630 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-27 10:39:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:56,631 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:39:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:56,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:56,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:56,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:56,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:56,632 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-27 10:39:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:39:56,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:39:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:56,633 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:39:56,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:39:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:39:56,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:56,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:56,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:39:56,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-27 10:39:56,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:56,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134176650] [2022-04-27 10:39:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(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(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:56,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:56,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:56,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:56,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(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(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:56,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:56,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:56,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:56,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {201#(= main_~x~0 0)} is VALID [2022-04-27 10:39:56,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:39:56,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {197#false} is VALID [2022-04-27 10:39:56,719 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {197#false} is VALID [2022-04-27 10:39:56,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:39:56,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:56,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:56,720 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-27 10:39:56,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:56,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134176650] [2022-04-27 10:39:56,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134176650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:39:56,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934329453] [2022-04-27 10:39:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:56,727 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-27 10:39:56,731 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-27 10:39:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:39:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:56,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:39:56,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:39:56,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:56,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:56,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:56,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:56,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {201#(= main_~x~0 0)} is VALID [2022-04-27 10:39:56,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {225#(= main_~x~0 1)} is VALID [2022-04-27 10:39:56,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 6); {197#false} is VALID [2022-04-27 10:39:56,848 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {197#false} is VALID [2022-04-27 10:39:56,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:39:56,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:56,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:56,849 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-27 10:39:56,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:39:57,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:57,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:57,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {244#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:39:57,007 INFO L272 TraceCheckUtils]: 8: Hoare triple {252#(= (mod main_~x~0 4294967296) 6)} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {248#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:39:57,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {252#(= (mod main_~x~0 4294967296) 6)} is VALID [2022-04-27 10:39:57,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {256#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} is VALID [2022-04-27 10:39:57,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {260#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} is VALID [2022-04-27 10:39:57,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:57,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:57,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:57,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:57,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:39:57,010 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-27 10:39:57,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934329453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:39:57,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:39:57,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-27 10:39:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042474152] [2022-04-27 10:39:57,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:39:57,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:39:57,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:57,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:57,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:57,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:39:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:39:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:39:57,030 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:57,246 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 10:39:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:39:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:39:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2022-04-27 10:39:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2022-04-27 10:39:57,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 20 transitions. [2022-04-27 10:39:57,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:57,270 INFO L225 Difference]: With dead ends: 18 [2022-04-27 10:39:57,271 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:39:57,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:39:57,272 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:57,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:39:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:39:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:39:57,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:57,273 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-27 10:39:57,273 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-27 10:39:57,274 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-27 10:39:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:57,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:39:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:39:57,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:57,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:57,274 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-27 10:39:57,274 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-27 10:39:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:57,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:39:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:39:57,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:57,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:57,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:57,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:57,275 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-27 10:39:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:39:57,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 10:39:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:57,275 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:39:57,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:39:57,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:57,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:39:57,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:39:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:57,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:39:57,513 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:39:57,513 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:39:57,513 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:39:57,513 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:39:57,513 INFO L895 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-27 10:39:57,514 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:39:57,514 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:39:57,514 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:39:57,514 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:39:57,514 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:39:57,514 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 22) the Hoare annotation is: true [2022-04-27 10:39:57,514 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 12 22) no Hoare annotation was computed. [2022-04-27 10:39:57,514 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 19) the Hoare annotation is: (let ((.cse0 (mod main_~x~0 4294967296))) (or (= .cse0 6) (< .cse0 6))) [2022-04-27 10:39:57,514 INFO L895 garLoopResultBuilder]: At program point L16-3(lines 16 19) the Hoare annotation is: (= (mod main_~x~0 4294967296) 6) [2022-04-27 10:39:57,514 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 12 22) no Hoare annotation was computed. [2022-04-27 10:39:57,515 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 10:39:57,515 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:39:57,515 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:39:57,515 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:39:57,515 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:39:57,515 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 10:39:57,518 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 10:39:57,519 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:39:57,522 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:39:57,522 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:39:57,523 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:39:57,523 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:39:57,524 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:39:57,524 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:39:57,528 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:39:57,529 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:39:57,529 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:39:57,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:39:57 BoogieIcfgContainer [2022-04-27 10:39:57,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:39:57,535 INFO L158 Benchmark]: Toolchain (without parser) took 2285.45ms. Allocated memory was 191.9MB in the beginning and 246.4MB in the end (delta: 54.5MB). Free memory was 138.6MB in the beginning and 197.3MB in the end (delta: -58.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:39:57,535 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:39:57,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.92ms. Allocated memory was 191.9MB in the beginning and 246.4MB in the end (delta: 54.5MB). Free memory was 138.4MB in the beginning and 222.3MB in the end (delta: -83.9MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-04-27 10:39:57,536 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 246.4MB. Free memory was 222.3MB in the beginning and 221.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:39:57,536 INFO L158 Benchmark]: RCFGBuilder took 201.00ms. Allocated memory is still 246.4MB. Free memory was 220.7MB in the beginning and 210.6MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 10:39:57,536 INFO L158 Benchmark]: TraceAbstraction took 1764.85ms. Allocated memory is still 246.4MB. Free memory was 210.2MB in the beginning and 197.3MB in the end (delta: 13.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-27 10:39:57,537 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 191.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.92ms. Allocated memory was 191.9MB in the beginning and 246.4MB in the end (delta: 54.5MB). Free memory was 138.4MB in the beginning and 222.3MB in the end (delta: -83.9MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 246.4MB. Free memory was 222.3MB in the beginning and 221.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 201.00ms. Allocated memory is still 246.4MB. Free memory was 220.7MB in the beginning and 210.6MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1764.85ms. Allocated memory is still 246.4MB. Free memory was 210.2MB in the beginning and 197.3MB in the end (delta: 13.0MB). Peak memory consumption was 13.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: 7]: 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.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 35 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 27 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, 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: 16]: Loop Invariant Derived loop invariant: x % 4294967296 == 6 || x % 4294967296 < 6 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:39:57,552 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...