/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-new/count_by_1_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:53:36,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:53:36,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:53:36,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:53:36,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:53:36,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:53:36,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:53:36,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:53:36,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:53:36,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:53:36,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:53:36,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:53:36,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:53:36,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:53:36,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:53:36,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:53:36,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:53:36,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:53:36,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:53:36,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:53:36,222 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:53:36,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:53:36,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:53:36,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:53:36,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:53:36,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:53:36,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:53:36,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:53:36,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:53:36,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:53:36,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:53:36,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:53:36,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:53:36,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:53:36,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:53:36,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:53:36,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:53:36,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:53:36,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:53:36,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:53:36,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:53:36,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:53:36,237 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:53:36,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:53:36,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:53:36,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:53:36,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:53:36,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:53:36,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:53:36,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:53:36,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:53:36,261 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:53:36,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:53:36,261 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:53:36,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:53:36,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:53:36,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:53:36,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:53:36,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:53:36,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:53:36,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:36,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:53:36,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:53:36,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:53:36,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:53:36,264 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:53:36,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:53:36,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:53:36,264 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:53:36,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:53:36,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:53:36,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:53:36,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:53:36,444 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:53:36,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-27 10:53:36,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2075985fe/4b18a33028e043c0aae454acb09f99cd/FLAGebc2f02c0 [2022-04-27 10:53:36,816 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:53:36,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-27 10:53:36,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2075985fe/4b18a33028e043c0aae454acb09f99cd/FLAGebc2f02c0 [2022-04-27 10:53:36,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2075985fe/4b18a33028e043c0aae454acb09f99cd [2022-04-27 10:53:36,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:53:36,830 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:53:36,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:36,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:53:36,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:53:36,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:36" (1/1) ... [2022-04-27 10:53:36,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710fe2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:36, skipping insertion in model container [2022-04-27 10:53:36,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:36" (1/1) ... [2022-04-27 10:53:36,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:53:36,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:53:36,966 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-new/count_by_1_variant.i[891,904] [2022-04-27 10:53:36,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:36,989 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:53:36,997 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-new/count_by_1_variant.i[891,904] [2022-04-27 10:53:36,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:37,007 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:53:37,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37 WrapperNode [2022-04-27 10:53:37,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:37,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:53:37,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:53:37,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:53:37,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:53:37,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:53:37,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:53:37,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:53:37,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (1/1) ... [2022-04-27 10:53:37,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:37,051 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:53:37,056 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:53:37,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:53:37,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:53:37,075 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:53:37,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:53:37,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:53:37,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:53:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:53:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:53:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:53:37,117 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:53:37,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:53:37,186 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:53:37,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:53:37,191 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:53:37,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:37 BoogieIcfgContainer [2022-04-27 10:53:37,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:53:37,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:53:37,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:53:37,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:53:37,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:53:36" (1/3) ... [2022-04-27 10:53:37,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37520f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:37, skipping insertion in model container [2022-04-27 10:53:37,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:37" (2/3) ... [2022-04-27 10:53:37,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37520f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:37, skipping insertion in model container [2022-04-27 10:53:37,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:37" (3/3) ... [2022-04-27 10:53:37,203 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i [2022-04-27 10:53:37,213 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:53:37,213 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:53:37,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:53:37,261 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@67d3d5d0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d800910 [2022-04-27 10:53:37,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:53:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:53:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:53:37,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:37,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:37,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1307585362, now seen corresponding path program 1 times [2022-04-27 10:53:37,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:37,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412822470] [2022-04-27 10:53:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:37,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(9, 2); {23#true} is VALID [2022-04-27 10:53:37,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:53:37,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-27 10:53:37,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:37,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(9, 2); {23#true} is VALID [2022-04-27 10:53:37,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:53:37,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-27 10:53:37,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-27 10:53:37,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~i~0 := 0; {28#(<= main_~i~0 1000000)} is VALID [2022-04-27 10:53:37,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {28#(<= main_~i~0 1000000)} is VALID [2022-04-27 10:53:37,489 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#(<= main_~i~0 1000000)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:37,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:37,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:53:37,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:53:37,491 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:53:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:37,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412822470] [2022-04-27 10:53:37,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412822470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:37,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:37,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:53:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826520696] [2022-04-27 10:53:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:37,500 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-27 10:53:37,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:37,504 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-27 10:53:37,522 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:53:37,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:53:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:53:37,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:53:37,547 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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-27 10:53:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:37,781 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 10:53:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:53:37,782 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-27 10:53:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:37,783 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-27 10:53:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 10:53:37,792 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-27 10:53:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 10:53:37,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-27 10:53:37,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:37,843 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:53:37,843 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:53:37,846 INFO L412 NwaCegarLoop]: 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-27 10:53:37,849 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:37,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:53:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 10:53:37,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:37,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:37,874 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:37,875 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:37,880 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:53:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:53:37,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:37,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:37,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 10:53:37,882 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 10:53:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:37,885 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:53:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:53:37,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:37,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:37,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:37,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-27 10:53:37,887 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2022-04-27 10:53:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:37,888 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-27 10:53:37,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 10:53:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:53:37,889 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:37,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:37,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:53:37,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:37,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2000663987, now seen corresponding path program 1 times [2022-04-27 10:53:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458486904] [2022-04-27 10:53:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:37,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {184#(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(9, 2); {171#true} is VALID [2022-04-27 10:53:37,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:37,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #51#return; {171#true} is VALID [2022-04-27 10:53:37,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:53:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:37,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-04-27 10:53:37,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-04-27 10:53:37,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:37,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {176#(= main_~i~0 0)} #49#return; {176#(= main_~i~0 0)} is VALID [2022-04-27 10:53:37,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:37,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#(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(9, 2); {171#true} is VALID [2022-04-27 10:53:37,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:37,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #51#return; {171#true} is VALID [2022-04-27 10:53:37,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret2 := main(); {171#true} is VALID [2022-04-27 10:53:37,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} havoc ~i~0;~i~0 := 0; {176#(= main_~i~0 0)} is VALID [2022-04-27 10:53:37,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(= main_~i~0 0)} assume !!(1000000 != ~i~0); {176#(= main_~i~0 0)} is VALID [2022-04-27 10:53:37,979 INFO L272 TraceCheckUtils]: 7: Hoare triple {176#(= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {171#true} is VALID [2022-04-27 10:53:37,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-04-27 10:53:37,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-04-27 10:53:37,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:37,980 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {171#true} {176#(= main_~i~0 0)} #49#return; {176#(= main_~i~0 0)} is VALID [2022-04-27 10:53:37,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {176#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {181#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:37,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {181#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:37,982 INFO L272 TraceCheckUtils]: 14: Hoare triple {181#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {182#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:37,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {182#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {183#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:37,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {183#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {172#false} is VALID [2022-04-27 10:53:37,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-27 10:53:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:37,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458486904] [2022-04-27 10:53:37,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458486904] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:37,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057559717] [2022-04-27 10:53:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:37,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:37,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:37,986 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:53:37,987 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:53:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:38,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:53:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:38,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:38,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2022-04-27 10:53:38,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#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(9, 2); {171#true} is VALID [2022-04-27 10:53:38,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:38,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #51#return; {171#true} is VALID [2022-04-27 10:53:38,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret2 := main(); {171#true} is VALID [2022-04-27 10:53:38,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} havoc ~i~0;~i~0 := 0; {203#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:38,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {203#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:38,224 INFO L272 TraceCheckUtils]: 7: Hoare triple {203#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {171#true} is VALID [2022-04-27 10:53:38,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-04-27 10:53:38,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-04-27 10:53:38,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:38,228 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {171#true} {203#(<= main_~i~0 0)} #49#return; {203#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:38,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {181#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:38,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {181#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:38,230 INFO L272 TraceCheckUtils]: 14: Hoare triple {181#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:38,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:38,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {172#false} is VALID [2022-04-27 10:53:38,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-27 10:53:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:38,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:38,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-27 10:53:38,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {172#false} is VALID [2022-04-27 10:53:38,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:38,369 INFO L272 TraceCheckUtils]: 14: Hoare triple {251#(<= main_~i~0 1000000)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:38,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {251#(<= main_~i~0 1000000)} is VALID [2022-04-27 10:53:38,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(<= main_~i~0 999999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {251#(<= main_~i~0 1000000)} is VALID [2022-04-27 10:53:38,371 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {171#true} {258#(<= main_~i~0 999999)} #49#return; {258#(<= main_~i~0 999999)} is VALID [2022-04-27 10:53:38,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:38,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-04-27 10:53:38,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-04-27 10:53:38,371 INFO L272 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 999999)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {171#true} is VALID [2022-04-27 10:53:38,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {258#(<= main_~i~0 999999)} assume !!(1000000 != ~i~0); {258#(<= main_~i~0 999999)} is VALID [2022-04-27 10:53:38,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} havoc ~i~0;~i~0 := 0; {258#(<= main_~i~0 999999)} is VALID [2022-04-27 10:53:38,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret2 := main(); {171#true} is VALID [2022-04-27 10:53:38,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #51#return; {171#true} is VALID [2022-04-27 10:53:38,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 10:53:38,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#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(9, 2); {171#true} is VALID [2022-04-27 10:53:38,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2022-04-27 10:53:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:38,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057559717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:38,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:38,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-27 10:53:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706783658] [2022-04-27 10:53:38,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:38,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-04-27 10:53:38,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:38,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:38,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:38,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:53:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:53:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:53:38,399 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:38,581 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-27 10:53:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:53:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-04-27 10:53:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-27 10:53:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-27 10:53:38,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-27 10:53:38,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:38,608 INFO L225 Difference]: With dead ends: 26 [2022-04-27 10:53:38,608 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:53:38,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:53:38,610 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:38,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:53:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:53:38,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:38,611 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:53:38,611 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:53:38,611 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:53:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:38,612 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:38,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:38,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:38,612 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:53:38,612 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:53:38,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:38,612 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:38,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:38,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:38,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:38,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:38,613 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:53:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:53:38,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 10:53:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:38,613 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:53:38,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:38,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:53:38,635 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:53:38,820 WARN L477 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-27 10:53:38,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:53:38,862 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:53:38,863 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:53:38,863 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:53:38,863 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:53:38,863 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:38,863 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:38,863 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:38,863 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 30) the Hoare annotation is: true [2022-04-27 10:53:38,864 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (<= main_~i~0 999999) [2022-04-27 10:53:38,864 INFO L899 garLoopResultBuilder]: For program point L27-1(lines 26 28) no Hoare annotation was computed. [2022-04-27 10:53:38,864 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 30) no Hoare annotation was computed. [2022-04-27 10:53:38,864 INFO L895 garLoopResultBuilder]: At program point L26-2(lines 26 28) the Hoare annotation is: (<= main_~i~0 1000000) [2022-04-27 10:53:38,864 INFO L899 garLoopResultBuilder]: For program point L26-3(lines 26 28) no Hoare annotation was computed. [2022-04-27 10:53:38,864 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 30) no Hoare annotation was computed. [2022-04-27 10:53:38,864 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:38,864 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:53:38,864 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:38,864 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:38,864 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:53:38,865 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:53:38,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:38,865 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:38,865 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:53:38,865 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:38,865 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:53:38,865 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:53:38,865 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:53:38,867 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 10:53:38,869 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:53:38,871 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:38,871 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:38,871 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:38,872 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:53:38,872 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:38,872 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:53:38,872 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:38,872 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:38,872 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:38,873 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:38,873 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-27 10:53:38,873 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-27 10:53:38,873 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:38,873 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:38,873 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:53:38,873 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:53:38,874 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:53:38,874 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:53:38,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:53:38 BoogieIcfgContainer [2022-04-27 10:53:38,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:53:38,879 INFO L158 Benchmark]: Toolchain (without parser) took 2048.92ms. Allocated memory was 191.9MB in the beginning and 253.8MB in the end (delta: 61.9MB). Free memory was 141.2MB in the beginning and 185.0MB in the end (delta: -43.7MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. [2022-04-27 10:53:38,880 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:53:38,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.62ms. Allocated memory is still 191.9MB. Free memory was 141.0MB in the beginning and 166.9MB in the end (delta: -25.9MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-27 10:53:38,880 INFO L158 Benchmark]: Boogie Preprocessor took 17.41ms. Allocated memory is still 191.9MB. Free memory was 166.9MB in the beginning and 165.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:53:38,881 INFO L158 Benchmark]: RCFGBuilder took 166.19ms. Allocated memory is still 191.9MB. Free memory was 165.2MB in the beginning and 154.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:53:38,881 INFO L158 Benchmark]: TraceAbstraction took 1685.23ms. Allocated memory was 191.9MB in the beginning and 253.8MB in the end (delta: 61.9MB). Free memory was 154.3MB in the beginning and 185.0MB in the end (delta: -30.7MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2022-04-27 10:53:38,882 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.10ms. Allocated memory is still 191.9MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.62ms. Allocated memory is still 191.9MB. Free memory was 141.0MB in the beginning and 166.9MB in the end (delta: -25.9MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.41ms. Allocated memory is still 191.9MB. Free memory was 166.9MB in the beginning and 165.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 166.19ms. Allocated memory is still 191.9MB. Free memory was 165.2MB in the beginning and 154.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1685.23ms. Allocated memory was 191.9MB in the beginning and 253.8MB in the end (delta: 61.9MB). Free memory was 154.3MB in the beginning and 185.0MB in the end (delta: -30.7MB). Peak memory consumption was 32.2MB. 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: 19]: 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 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 22 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=1, InterpolantAutomatonStates: 16, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 17 HoareAnnotationTreeSize, 10 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 1 NumberOfNonLiveVariables, 59 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/12 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: 26]: Loop Invariant Derived loop invariant: i <= 1000000 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:53:38,925 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...