/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/nla-digbench-scaling/freire1_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:11:10,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:11:10,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:11:10,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:11:10,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:11:10,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:11:10,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:11:10,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:11:10,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:11:10,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:11:10,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:11:10,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:11:10,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:11:10,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:11:10,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:11:10,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:11:10,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:11:10,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:11:10,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:11:10,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:11:10,266 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:11:10,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:11:10,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:11:10,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:11:10,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:11:10,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:11:10,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:11:10,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:11:10,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:11:10,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:11:10,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:11:10,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:11:10,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:11:10,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:11:10,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:11:10,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:11:10,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:11:10,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:11:10,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:11:10,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:11:10,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:11:10,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:11:10,287 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 03:11:10,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:11:10,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:11:10,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:11:10,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:11:10,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:11:10,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:11:10,315 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:11:10,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:11:10,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:11:10,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:11:10,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:11:10,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:11:10,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:11:10,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:11:10,317 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:11:10,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:11:10,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:11:10,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:11:10,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:11:10,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:11:10,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:11:10,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:11:10,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:11:10,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:11:10,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:11:10,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:11:10,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:11:10,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:11:10,320 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:11:10,320 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 03:11:10,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:11:10,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:11:10,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:11:10,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:11:10,595 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:11:10,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire1_valuebound2.c [2022-04-15 03:11:10,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31abdf98c/0226e9f68e5a4f4facf15b1734da1d74/FLAG3db6f2d31 [2022-04-15 03:11:11,086 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:11:11,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_valuebound2.c [2022-04-15 03:11:11,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31abdf98c/0226e9f68e5a4f4facf15b1734da1d74/FLAG3db6f2d31 [2022-04-15 03:11:11,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31abdf98c/0226e9f68e5a4f4facf15b1734da1d74 [2022-04-15 03:11:11,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:11:11,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:11:11,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:11:11,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:11:11,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:11:11,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2337d490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11, skipping insertion in model container [2022-04-15 03:11:11,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:11:11,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:11:11,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2022-04-15 03:11:11,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:11:11,394 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:11:11,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2022-04-15 03:11:11,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:11:11,433 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:11:11,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11 WrapperNode [2022-04-15 03:11:11,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:11:11,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:11:11,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:11:11,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:11:11,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:11:11,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:11:11,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:11:11,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:11:11,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:11:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:11:11,502 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 03:11:11,526 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 03:11:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:11:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:11:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:11:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:11:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:11:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:11:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:11:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:11:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:11:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:11:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-15 03:11:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:11:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:11:11,599 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:11:11,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:11:11,709 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:11:11,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:11:11,722 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:11:11,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:11 BoogieIcfgContainer [2022-04-15 03:11:11,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:11:11,725 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:11:11,725 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:11:11,728 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:11:11,731 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:11" (1/1) ... [2022-04-15 03:11:11,733 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:11:11,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:11:11 BasicIcfg [2022-04-15 03:11:11,792 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:11:11,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:11:11,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:11:11,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:11:11,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:11:11" (1/4) ... [2022-04-15 03:11:11,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e75514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:11, skipping insertion in model container [2022-04-15 03:11:11,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:11" (2/4) ... [2022-04-15 03:11:11,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e75514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:11, skipping insertion in model container [2022-04-15 03:11:11,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:11" (3/4) ... [2022-04-15 03:11:11,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e75514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:11:11, skipping insertion in model container [2022-04-15 03:11:11,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:11:11" (4/4) ... [2022-04-15 03:11:11,802 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound2.cqvasr [2022-04-15 03:11:11,816 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:11:11,816 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:11:11,878 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:11:11,885 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 03:11:11,885 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:11:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 03:11:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 03:11:11,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:11:11,906 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:11:11,907 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:11:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:11:11,911 INFO L85 PathProgramCache]: Analyzing trace with hash 409333534, now seen corresponding path program 1 times [2022-04-15 03:11:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:11:11,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933502291] [2022-04-15 03:11:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:11:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:11:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:11:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 03:11:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:11:12,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-15 03:11:12,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-15 03:11:12,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-15 03:11:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 03:11:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:11:12,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} [68] assume_abort_if_notENTRY-->L14: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30#true} is VALID [2022-04-15 03:11:12,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [72] L14-->L14-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-15 03:11:12,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} [76] L14-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-15 03:11:12,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} [88] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and v_~someBinaryDOUBLEComparisonOperation_11 v_~someBinaryDOUBLEComparisonOperation_12) 1 0)) InVars {} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[v_~someBinaryDOUBLEComparisonOperation_11, v_~someBinaryDOUBLEComparisonOperation_12] AssignedVars[assume_abort_if_not_#in~cond] {31#false} is VALID [2022-04-15 03:11:12,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 03:11:12,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-15 03:11:12,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-15 03:11:12,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-15 03:11:12,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-15 03:11:12,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} [64] mainENTRY-->L28: Formula: (= v_main_~a~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~r~0, main_~a~0] {30#true} is VALID [2022-04-15 03:11:12,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} [66] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and v_~someBinaryDOUBLEComparisonOperation_11 v_~someBinaryDOUBLEComparisonOperation_12) 1 0)) InVars {} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[v_~someBinaryDOUBLEComparisonOperation_11, v_~someBinaryDOUBLEComparisonOperation_12] AssignedVars[assume_abort_if_not_#in~cond] {30#true} is VALID [2022-04-15 03:11:12,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} [68] assume_abort_if_notENTRY-->L14: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30#true} is VALID [2022-04-15 03:11:12,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} [72] L14-->L14-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-15 03:11:12,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} [76] L14-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-15 03:11:12,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} [88] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and v_~someBinaryDOUBLEComparisonOperation_11 v_~someBinaryDOUBLEComparisonOperation_12) 1 0)) InVars {} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[v_~someBinaryDOUBLEComparisonOperation_11, v_~someBinaryDOUBLEComparisonOperation_12] AssignedVars[assume_abort_if_not_#in~cond] {31#false} is VALID [2022-04-15 03:11:12,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} [67] L28-1-->L32-2: Formula: (= v_main_~r~0_4 0) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~x~0, main_~r~0] {31#false} is VALID [2022-04-15 03:11:12,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} [69] L32-2-->L32-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-15 03:11:12,155 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} [74] L32-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_~convertDOUBLEToINT_7 0) 1 0)) InVars {} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[v_~convertDOUBLEToINT_7] AssignedVars[__VERIFIER_assert_#in~cond] {31#false} is VALID [2022-04-15 03:11:12,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} [78] __VERIFIER_assertENTRY-->L17: 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] {31#false} is VALID [2022-04-15 03:11:12,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} [82] L17-->L18: 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[] {31#false} is VALID [2022-04-15 03:11:12,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} [84] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-15 03:11:12,156 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 03:11:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:11:12,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933502291] [2022-04-15 03:11:12,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933502291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:11:12,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:11:12,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 03:11:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230424856] [2022-04-15 03:11:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:11:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 03:11:12,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:11:12,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 03:11:12,217 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-15 03:11:12,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 03:11:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:11:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 03:11:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 03:11:12,243 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 03:11:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:11:12,362 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 03:11:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 03:11:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 03:11:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:11:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 03:11:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-15 03:11:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 03:11:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-15 03:11:12,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-15 03:11:12,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:11:12,574 INFO L225 Difference]: With dead ends: 45 [2022-04-15 03:11:12,574 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 03:11:12,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 03:11:12,582 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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-15 03:11:12,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:11:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 03:11:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 03:11:12,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:11:12,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:11:12,614 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:11:12,614 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:11:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:11:12,617 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 03:11:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 03:11:12,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:11:12,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:11:12,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 03:11:12,618 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 03:11:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:11:12,620 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 03:11:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 03:11:12,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:11:12,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:11:12,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:11:12,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:11:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:11:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 03:11:12,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-15 03:11:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:11:12,625 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 03:11:12,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 03:11:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 03:11:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 03:11:12,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:11:12,626 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:11:12,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 03:11:12,627 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:11:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:11:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1396244096, now seen corresponding path program 1 times [2022-04-15 03:11:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:11:12,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713044251] [2022-04-15 03:11:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:11:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:11:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:11:12,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 03:11:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:11:12,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 03:11:12,700 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 03:11:12,701 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:11:12,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 03:11:12,705 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 03:11:12,711 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:11:12,737 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 03:11:12,737 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-15 03:11:12,738 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-15 03:11:12,739 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 03:11:12,740 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 03:11:12,740 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 03:11:12,740 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-15 03:11:12,740 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-15 03:11:12,740 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-15 03:11:12,740 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-15 03:11:12,741 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:11:12,741 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 03:11:12,742 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:11:12,742 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:11:12,742 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 03:11:12,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:11:12 BasicIcfg [2022-04-15 03:11:12,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:11:12,745 INFO L158 Benchmark]: Toolchain (without parser) took 1626.75ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 122.5MB in the beginning and 132.9MB in the end (delta: -10.4MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2022-04-15 03:11:12,747 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:11:12,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.17ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 122.3MB in the beginning and 187.1MB in the end (delta: -64.8MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-04-15 03:11:12,750 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 210.8MB. Free memory was 187.1MB in the beginning and 185.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:11:12,753 INFO L158 Benchmark]: RCFGBuilder took 252.59ms. Allocated memory is still 210.8MB. Free memory was 185.7MB in the beginning and 174.9MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 03:11:12,754 INFO L158 Benchmark]: IcfgTransformer took 67.64ms. Allocated memory is still 210.8MB. Free memory was 174.9MB in the beginning and 173.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:11:12,754 INFO L158 Benchmark]: TraceAbstraction took 949.73ms. Allocated memory is still 210.8MB. Free memory was 173.1MB in the beginning and 132.9MB in the end (delta: 40.2MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-04-15 03:11:12,756 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.13ms. Allocated memory is still 175.1MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 315.17ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 122.3MB in the beginning and 187.1MB in the end (delta: -64.8MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 210.8MB. Free memory was 187.1MB in the beginning and 185.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 252.59ms. Allocated memory is still 210.8MB. Free memory was 185.7MB in the beginning and 174.9MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 67.64ms. Allocated memory is still 210.8MB. Free memory was 174.9MB in the beginning and 173.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 949.73ms. Allocated memory is still 210.8MB. Free memory was 173.1MB in the beginning and 132.9MB in the end (delta: 40.2MB). Peak memory consumption was 40.9MB. 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 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=2) VAL [\old(cond)=1] [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=2) VAL [a=50] [L29] x = a / 2.0 [L30] r = 0 VAL [a=50, r=0] [L32] COND TRUE 1 VAL [a=50, r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 25 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 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 could not prove your program: unable to determine feasibility of some traces [2022-04-15 03:11:12,785 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...