/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/while_infinite_loop_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:09:40,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:09:40,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:09:41,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:09:41,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:09:41,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:09:41,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:09:41,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:09:41,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:09:41,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:09:41,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:09:41,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:09:41,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:09:41,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:09:41,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:09:41,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:09:41,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:09:41,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:09:41,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:09:41,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:09:41,029 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:09:41,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:09:41,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:09:41,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:09:41,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:09:41,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:09:41,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:09:41,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:09:41,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:09:41,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:09:41,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:09:41,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:09:41,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:09:41,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:09:41,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:09:41,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:09:41,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:09:41,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:09:41,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:09:41,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:09:41,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:09:41,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:09:41,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:09:41,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:09:41,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:09:41,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:09:41,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:09:41,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:09:41,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:09:41,063 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:09:41,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:09:41,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:09:41,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:09:41,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:09:41,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:09:41,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:09:41,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:09:41,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:09:41,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:09:41,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:09:41,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:09:41,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:09:41,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:09:41,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:09:41,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:09:41,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:09:41,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:09:41,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:09:41,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:09:41,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:09:41,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:09:41,066 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:09:41,066 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:09:41,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:09:41,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:09:41,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:09:41,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:09:41,269 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:09:41,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/while_infinite_loop_4.c [2022-04-15 00:09:41,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5d06818/98498c0137b9460c9587fa7f2551b8a4/FLAG2fabe910c [2022-04-15 00:09:41,705 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:09:41,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/while_infinite_loop_4.c [2022-04-15 00:09:41,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5d06818/98498c0137b9460c9587fa7f2551b8a4/FLAG2fabe910c [2022-04-15 00:09:42,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5d06818/98498c0137b9460c9587fa7f2551b8a4 [2022-04-15 00:09:42,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:09:42,124 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:09:42,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:09:42,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:09:42,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:09:42,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cd5c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42, skipping insertion in model container [2022-04-15 00:09:42,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:09:42,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:09:42,261 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/while_infinite_loop_4.c[333,346] [2022-04-15 00:09:42,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:09:42,292 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:09:42,302 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/while_infinite_loop_4.c[333,346] [2022-04-15 00:09:42,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:09:42,314 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:09:42,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42 WrapperNode [2022-04-15 00:09:42,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:09:42,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:09:42,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:09:42,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:09:42,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:09:42,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:09:42,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:09:42,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:09:42,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:09:42,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:09:42,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:09:42,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:09:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:09:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:09:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:09:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:09:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2022-04-15 00:09:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:09:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:09:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:09:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:09:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:09:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:09:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2022-04-15 00:09:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:09:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:09:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:09:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:09:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:09:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:09:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:09:42,469 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:09:42,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:09:42,536 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:09:42,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:09:42,542 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 00:09:42,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:09:42 BoogieIcfgContainer [2022-04-15 00:09:42,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:09:42,544 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:09:42,544 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:09:42,545 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:09:42,548 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:09:42" (1/1) ... [2022-04-15 00:09:42,549 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:09:42,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:09:42 BasicIcfg [2022-04-15 00:09:42,562 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:09:42,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:09:42,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:09:42,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:09:42,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:09:42" (1/4) ... [2022-04-15 00:09:42,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcc04b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:09:42, skipping insertion in model container [2022-04-15 00:09:42,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:42" (2/4) ... [2022-04-15 00:09:42,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcc04b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:09:42, skipping insertion in model container [2022-04-15 00:09:42,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:09:42" (3/4) ... [2022-04-15 00:09:42,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcc04b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:09:42, skipping insertion in model container [2022-04-15 00:09:42,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:09:42" (4/4) ... [2022-04-15 00:09:42,569 INFO L111 eAbstractionObserver]: Analyzing ICFG while_infinite_loop_4.cqvasr [2022-04-15 00:09:42,573 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:09:42,573 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:09:42,607 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:09:42,613 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-15 00:09:42,613 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:09:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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-15 00:09:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 00:09:42,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:09:42,633 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:09:42,634 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:09:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:09:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash -459487812, now seen corresponding path program 1 times [2022-04-15 00:09:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:09:42,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035574045] [2022-04-15 00:09:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:09:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:09:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:09:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:09:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:09:42,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 24) (= v_~x~0_5 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~x~0=v_~x~0_5, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, ~x~0, #NULL.base] {26#true} is VALID [2022-04-15 00:09:42,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:09:42,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:09:42,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:09:42,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 24) (= v_~x~0_5 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~x~0=v_~x~0_5, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, ~x~0, #NULL.base] {26#true} is VALID [2022-04-15 00:09:42,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:09:42,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:09:42,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [57] L-1-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:09:42,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [60] L29-->L26-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:09:42,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {27#false} [64] L26-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_~x~0_12 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {~x~0=v_~x~0_12} OutVars{~x~0=v_~x~0_12, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond] {27#false} is VALID [2022-04-15 00:09:42,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} [67] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-15 00:09:42,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [73] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:09:42,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [76] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:09:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:09:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:09:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035574045] [2022-04-15 00:09:42,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035574045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:09:42,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:09:42,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:09:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026868112] [2022-04-15 00:09:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:09:42,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2022-04-15 00:09:42,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:09:42,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:09:42,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:09:42,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:09:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:09:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:09:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:09:42,974 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:09:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:43,089 INFO L93 Difference]: Finished difference Result 37 states and 53 transitions. [2022-04-15 00:09:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:09:43,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2022-04-15 00:09:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:09:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:09:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-15 00:09:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:09:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-15 00:09:43,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-15 00:09:43,179 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-15 00:09:43,188 INFO L225 Difference]: With dead ends: 37 [2022-04-15 00:09:43,189 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 00:09:43,191 INFO L912 BasicCegarLoop]: 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-15 00:09:43,197 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:09:43,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:09:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 00:09:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-04-15 00:09:43,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:09:43,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:09:43,229 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:09:43,229 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:09:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:43,232 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 00:09:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 00:09:43,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:09:43,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:09:43,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-15 00:09:43,233 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-15 00:09:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:43,235 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 00:09:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 00:09:43,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:09:43,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:09:43,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:09:43,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:09:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:09:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 00:09:43,239 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-04-15 00:09:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:09:43,240 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 00:09:43,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:09:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 00:09:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:09:43,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:09:43,241 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:09:43,241 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:09:43,241 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:09:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:09:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2132896698, now seen corresponding path program 1 times [2022-04-15 00:09:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:09:43,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361085359] [2022-04-15 00:09:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:09:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:09:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:09:43,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:09:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:09:43,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:09:43,330 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:09:43,332 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:09:43,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:09:43,337 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 00:09:43,340 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: evalENTRY has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: evalENTRY has no Hoare annotation [2022-04-15 00:09:43,366 WARN L170 areAnnotationChecker]: evalENTRY has no Hoare annotation [2022-04-15 00:09:43,367 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:09:43,367 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-15 00:09:43,367 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 00:09:43,367 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:09:43,367 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: evalEXIT has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:09:43,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:09:43,369 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-15 00:09:43,369 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-15 00:09:43,369 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:09:43,369 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:09:43,369 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:09:43,369 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:09:43,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:09:43 BasicIcfg [2022-04-15 00:09:43,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:09:43,372 INFO L158 Benchmark]: Toolchain (without parser) took 1247.32ms. Allocated memory was 200.3MB in the beginning and 277.9MB in the end (delta: 77.6MB). Free memory was 141.2MB in the beginning and 198.2MB in the end (delta: -57.0MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. [2022-04-15 00:09:43,373 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:09:43,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.65ms. Allocated memory was 200.3MB in the beginning and 277.9MB in the end (delta: 77.6MB). Free memory was 141.0MB in the beginning and 249.0MB in the end (delta: -108.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-15 00:09:43,376 INFO L158 Benchmark]: Boogie Preprocessor took 35.69ms. Allocated memory is still 277.9MB. Free memory was 249.0MB in the beginning and 247.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:09:43,379 INFO L158 Benchmark]: RCFGBuilder took 191.28ms. Allocated memory is still 277.9MB. Free memory was 247.5MB in the beginning and 237.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 00:09:43,379 INFO L158 Benchmark]: IcfgTransformer took 18.00ms. Allocated memory is still 277.9MB. Free memory was 237.0MB in the beginning and 235.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:09:43,380 INFO L158 Benchmark]: TraceAbstraction took 807.37ms. Allocated memory is still 277.9MB. Free memory was 234.9MB in the beginning and 198.2MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-15 00:09:43,386 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 200.3MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.65ms. Allocated memory was 200.3MB in the beginning and 277.9MB in the end (delta: 77.6MB). Free memory was 141.0MB in the beginning and 249.0MB in the end (delta: -108.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.69ms. Allocated memory is still 277.9MB. Free memory was 249.0MB in the beginning and 247.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 191.28ms. Allocated memory is still 277.9MB. Free memory was 247.5MB in the beginning and 237.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 18.00ms. Allocated memory is still 277.9MB. Free memory was 237.0MB in the beginning and 235.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 807.37ms. Allocated memory is still 277.9MB. Free memory was 234.9MB in the beginning and 198.2MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. 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 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int x=0; VAL [\old(x)=50, x=0] [L26] COND TRUE 1 VAL [\old(x)=0, x=0] [L28] CALL eval() VAL [\old(x)=0, x=0] [L16] COND TRUE 1 [L17] x=1 VAL [\old(x)=0, x=1] [L28] RET eval() VAL [\old(x)=0, x=1] [L29] CALL __VERIFIER_assert(x==0) VAL [\old(cond)=0, \old(x)=0, x=1] [L6] COND TRUE !(cond) VAL [\old(cond)=0, \old(x)=0, cond=0, x=1] [L7] reach_error() VAL [\old(cond)=0, \old(x)=0, cond=0, x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 18 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 00:09:43,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...