/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/loops/trex04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:21:05,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:21:05,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:21:05,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:21:05,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:21:05,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:21:05,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:21:05,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:21:05,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:21:05,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:21:05,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:21:05,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:21:05,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:21:05,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:21:05,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:21:05,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:21:05,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:21:05,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:21:05,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:21:05,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:21:05,090 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:21:05,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:21:05,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:21:05,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:21:05,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:21:05,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:21:05,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:21:05,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:21:05,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:21:05,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:21:05,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:21:05,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:21:05,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:21:05,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:21:05,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:21:05,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:21:05,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:21:05,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:21:05,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:21:05,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:21:05,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:21:05,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:21:05,112 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:21:05,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:21:05,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:21:05,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:21:05,146 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:21:05,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:21:05,147 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:21:05,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:21:05,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:21:05,148 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:21:05,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:21:05,149 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:21:05,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:21:05,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:21:05,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:21:05,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:21:05,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:21:05,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:21:05,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:21:05,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:21:05,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:21:05,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:21:05,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:21:05,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:21:05,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:21:05,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:05,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:21:05,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:21:05,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:21:05,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:21:05,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:21:05,153 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:21:05,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:21:05,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:21:05,153 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:21:05,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:21:05,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:21:05,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:21:05,381 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:21:05,382 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:21:05,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex04.c [2022-04-27 10:21:05,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f85d111f/7e8aae6567db479f9c10e2d0c4a8e196/FLAG9d64f4c4d [2022-04-27 10:21:05,759 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:21:05,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex04.c [2022-04-27 10:21:05,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f85d111f/7e8aae6567db479f9c10e2d0c4a8e196/FLAG9d64f4c4d [2022-04-27 10:21:06,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f85d111f/7e8aae6567db479f9c10e2d0c4a8e196 [2022-04-27 10:21:06,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:21:06,186 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:21:06,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:06,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:21:06,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:21:06,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f840c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06, skipping insertion in model container [2022-04-27 10:21:06,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:21:06,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:21:06,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/trex04.c[405,418] [2022-04-27 10:21:06,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:06,370 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:21:06,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/trex04.c[405,418] [2022-04-27 10:21:06,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:06,399 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:21:06,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06 WrapperNode [2022-04-27 10:21:06,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:06,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:21:06,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:21:06,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:21:06,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:21:06,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:21:06,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:21:06,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:21:06,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (1/1) ... [2022-04-27 10:21:06,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:06,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:06,464 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:21:06,484 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:21:06,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:21:06,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:21:06,505 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:21:06,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:21:06,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:21:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2022-04-27 10:21:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:21:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:21:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:21:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:21:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:21:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:21:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:21:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:21:06,570 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:21:06,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:21:06,707 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:21:06,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:21:06,714 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:21:06,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:06 BoogieIcfgContainer [2022-04-27 10:21:06,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:21:06,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:21:06,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:21:06,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:21:06,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:21:06" (1/3) ... [2022-04-27 10:21:06,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566d997d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:06, skipping insertion in model container [2022-04-27 10:21:06,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:06" (2/3) ... [2022-04-27 10:21:06,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566d997d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:06, skipping insertion in model container [2022-04-27 10:21:06,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:06" (3/3) ... [2022-04-27 10:21:06,739 INFO L111 eAbstractionObserver]: Analyzing ICFG trex04.c [2022-04-27 10:21:06,749 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:21:06,750 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:21:06,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:21:06,819 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@5efeb814, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68177455 [2022-04-27 10:21:06,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:21:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:21:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:21:06,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:06,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:06,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1661240883, now seen corresponding path program 1 times [2022-04-27 10:21:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351691431] [2022-04-27 10:21:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:06,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:06,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 10:21:06,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 10:21:06,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 10:21:06,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:06,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 10:21:06,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 10:21:06,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 10:21:06,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2022-04-27 10:21:06,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} ~d~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~x~0 := #t~nondet8;havoc #t~nondet8; {34#true} is VALID [2022-04-27 10:21:06,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !!(~x~0 <= 1000000 && ~x~0 >= -1000000);~c1~1 := #t~nondet9;havoc #t~nondet9;~c2~1 := #t~nondet10;havoc #t~nondet10; {34#true} is VALID [2022-04-27 10:21:06,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} assume !(0 != ~c1~1 % 256); {34#true} is VALID [2022-04-27 10:21:06,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume !(0 != ~c2~1 % 256); {34#true} is VALID [2022-04-27 10:21:06,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#true} ~c1~1 := #t~nondet11;havoc #t~nondet11;~c2~1 := #t~nondet12;havoc #t~nondet12; {34#true} is VALID [2022-04-27 10:21:06,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#true} assume !(0 != ~c1~1 % 256); {34#true} is VALID [2022-04-27 10:21:07,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#true} assume 0 != ~c2~1 % 256;~d~0 := ~d~0 - 1; {34#true} is VALID [2022-04-27 10:21:07,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 10:21:07,001 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~x~0 <= 0 then 1 else 0)); {35#false} is VALID [2022-04-27 10:21:07,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 10:21:07,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 10:21:07,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 10:21:07,002 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:21:07,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:07,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351691431] [2022-04-27 10:21:07,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351691431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:07,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:07,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:21:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233438501] [2022-04-27 10:21:07,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:21:07,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:07,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:07,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:21:07,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:07,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:21:07,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:21:07,056 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:07,180 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-27 10:21:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:21:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:21:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-27 10:21:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-27 10:21:07,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-27 10:21:07,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:07,280 INFO L225 Difference]: With dead ends: 42 [2022-04-27 10:21:07,280 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 10:21:07,282 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:21:07,291 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:07,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:21:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 10:21:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 10:21:07,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:07,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:07,328 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:07,329 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:07,343 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 10:21:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 10:21:07,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:07,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:07,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 10:21:07,344 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 10:21:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:07,348 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 10:21:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 10:21:07,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:07,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:07,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:07,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-27 10:21:07,353 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2022-04-27 10:21:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:07,353 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-27 10:21:07,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 10:21:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:21:07,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:07,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:07,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:21:07,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1664934967, now seen corresponding path program 1 times [2022-04-27 10:21:07,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:07,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743144315] [2022-04-27 10:21:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:07,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:07,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(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);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-27 10:21:07,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-27 10:21:07,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #92#return; {179#true} is VALID [2022-04-27 10:21:07,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:07,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(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);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-27 10:21:07,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-27 10:21:07,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #92#return; {179#true} is VALID [2022-04-27 10:21:07,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret13 := main(); {179#true} is VALID [2022-04-27 10:21:07,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#true} ~d~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~x~0 := #t~nondet8;havoc #t~nondet8; {179#true} is VALID [2022-04-27 10:21:07,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {179#true} assume !!(~x~0 <= 1000000 && ~x~0 >= -1000000);~c1~1 := #t~nondet9;havoc #t~nondet9;~c2~1 := #t~nondet10;havoc #t~nondet10; {179#true} is VALID [2022-04-27 10:21:07,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#true} assume !(0 != ~c1~1 % 256); {179#true} is VALID [2022-04-27 10:21:07,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#true} assume !(0 != ~c2~1 % 256); {179#true} is VALID [2022-04-27 10:21:07,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#true} ~c1~1 := #t~nondet11;havoc #t~nondet11;~c2~1 := #t~nondet12;havoc #t~nondet12; {179#true} is VALID [2022-04-27 10:21:07,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {179#true} assume !(0 != ~c1~1 % 256); {179#true} is VALID [2022-04-27 10:21:07,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {179#true} assume 0 != ~c2~1 % 256;~d~0 := ~d~0 - 1; {179#true} is VALID [2022-04-27 10:21:07,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {179#true} assume !(~x~0 > 0); {184#(<= main_~x~0 0)} is VALID [2022-04-27 10:21:07,460 INFO L272 TraceCheckUtils]: 13: Hoare triple {184#(<= main_~x~0 0)} call __VERIFIER_assert((if ~x~0 <= 0 then 1 else 0)); {185#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:21:07,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {185#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {186#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:21:07,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {180#false} is VALID [2022-04-27 10:21:07,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-04-27 10:21:07,462 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:21:07,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:07,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743144315] [2022-04-27 10:21:07,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743144315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:07,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:07,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:21:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005583617] [2022-04-27 10:21:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:21:07,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:07,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:07,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:21:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:07,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:21:07,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:21:07,480 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:07,719 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 10:21:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:21:07,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:21:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 10:21:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 10:21:07,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-27 10:21:07,760 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:21:07,760 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:21:07,760 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:21:07,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:21:07,767 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:07,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:21:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:21:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:21:07,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:07,769 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:21:07,769 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:21:07,769 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:21:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:07,770 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:21:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:07,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:07,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:07,770 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:21:07,770 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:21:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:07,770 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:21:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:07,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:07,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:07,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:07,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:07,771 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:21:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:21:07,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 10:21:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:07,772 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:21:07,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:07,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:07,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:21:07,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:21:07,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:21:07,803 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:21:07,803 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:21:07,803 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:21:07,803 INFO L899 garLoopResultBuilder]: For program point fooEXIT(lines 18 25) no Hoare annotation was computed. [2022-04-27 10:21:07,804 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 10:21:07,804 INFO L899 garLoopResultBuilder]: For program point L23-1(lines 18 25) no Hoare annotation was computed. [2022-04-27 10:21:07,804 INFO L902 garLoopResultBuilder]: At program point fooENTRY(lines 18 25) the Hoare annotation is: true [2022-04-27 10:21:07,805 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 19 25) no Hoare annotation was computed. [2022-04-27 10:21:07,805 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-27 10:21:07,805 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-27 10:21:07,805 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-27 10:21:07,806 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-27 10:21:07,806 INFO L899 garLoopResultBuilder]: For program point L35-2(line 35) no Hoare annotation was computed. [2022-04-27 10:21:07,806 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 10:21:07,806 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 27 48) no Hoare annotation was computed. [2022-04-27 10:21:07,806 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 27 48) no Hoare annotation was computed. [2022-04-27 10:21:07,807 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 28 48) no Hoare annotation was computed. [2022-04-27 10:21:07,807 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 45) the Hoare annotation is: (<= main_~x~0 0) [2022-04-27 10:21:07,807 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-27 10:21:07,808 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 28 48) no Hoare annotation was computed. [2022-04-27 10:21:07,808 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 27 48) the Hoare annotation is: true [2022-04-27 10:21:07,808 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-04-27 10:21:07,811 INFO L902 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: true [2022-04-27 10:21:07,812 INFO L899 garLoopResultBuilder]: For program point L39-3(lines 28 48) no Hoare annotation was computed. [2022-04-27 10:21:07,818 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-27 10:21:07,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:21:07,818 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:21:07,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:21:07,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:21:07,818 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:21:07,818 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:21:07,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:21:07,819 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 14) the Hoare annotation is: true [2022-04-27 10:21:07,819 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-04-27 10:21:07,819 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 12) no Hoare annotation was computed. [2022-04-27 10:21:07,819 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 14) no Hoare annotation was computed. [2022-04-27 10:21:07,819 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 14) no Hoare annotation was computed. [2022-04-27 10:21:07,819 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2022-04-27 10:21:07,822 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 10:21:07,824 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:21:07,827 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:21:07,827 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:21:07,827 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 10:21:07,830 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:21:07,830 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:21:07,830 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 10:21:07,830 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:21:07,830 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:21:07,830 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 10:21:07,830 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 10:21:07,831 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-04-27 10:21:07,832 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 10:21:07,833 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:21:07,833 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:21:07,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:21:07 BoogieIcfgContainer [2022-04-27 10:21:07,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:21:07,838 INFO L158 Benchmark]: Toolchain (without parser) took 1649.63ms. Allocated memory was 204.5MB in the beginning and 286.3MB in the end (delta: 81.8MB). Free memory was 147.3MB in the beginning and 238.2MB in the end (delta: -90.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:21:07,847 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 204.5MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:21:07,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.17ms. Allocated memory was 204.5MB in the beginning and 286.3MB in the end (delta: 81.8MB). Free memory was 147.2MB in the beginning and 256.2MB in the end (delta: -109.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-04-27 10:21:07,848 INFO L158 Benchmark]: Boogie Preprocessor took 31.78ms. Allocated memory is still 286.3MB. Free memory was 256.2MB in the beginning and 254.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:21:07,848 INFO L158 Benchmark]: RCFGBuilder took 283.24ms. Allocated memory is still 286.3MB. Free memory was 254.2MB in the beginning and 242.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:21:07,848 INFO L158 Benchmark]: TraceAbstraction took 1118.15ms. Allocated memory is still 286.3MB. Free memory was 241.7MB in the beginning and 238.2MB in the end (delta: 3.5MB). Peak memory consumption was 3.8MB. Max. memory is 8.0GB. [2022-04-27 10:21:07,849 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 204.5MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.17ms. Allocated memory was 204.5MB in the beginning and 286.3MB in the end (delta: 81.8MB). Free memory was 147.2MB in the beginning and 256.2MB in the end (delta: -109.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.78ms. Allocated memory is still 286.3MB. Free memory was 256.2MB in the beginning and 254.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 283.24ms. Allocated memory is still 286.3MB. Free memory was 254.2MB in the beginning and 242.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1118.15ms. Allocated memory is still 286.3MB. Free memory was 241.7MB in the beginning and 238.2MB in the end (delta: 3.5MB). Peak memory consumption was 3.8MB. 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: 11]: 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 7 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 63 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 12 NumberOfFragments, 17 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 52 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:21:07,889 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...