/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/freire2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:40:31,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:40:31,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:40:31,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:40:31,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:40:31,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:40:31,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:40:31,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:40:31,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:40:31,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:40:31,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:40:31,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:40:31,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:40:31,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:40:31,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:40:31,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:40:31,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:40:31,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:40:31,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:40:31,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:40:31,359 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:40:31,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:40:31,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:40:31,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:40:31,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:40:31,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:40:31,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:40:31,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:40:31,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:40:31,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:40:31,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:40:31,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:40:31,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:40:31,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:40:31,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:40:31,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:40:31,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:40:31,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:40:31,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:40:31,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:40:31,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:40:31,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:40:31,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:40:31,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:40:31,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:40:31,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:40:31,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:40:31,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:40:31,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:40:31,395 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:40:31,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:40:31,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:40:31,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:40:31,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:40:31,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:40:31,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:40:31,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:40:31,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:40:31,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:40:31,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:40:31,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:40:31,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:40:31,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:40:31,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:40:31,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:40:31,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:40:31,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:40:31,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:40:31,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:40:31,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:40:31,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:40:31,399 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:40:31,399 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-27 22:40:31,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:40:31,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:40:31,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:40:31,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:40:31,597 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:40:31,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/freire2.c [2022-04-27 22:40:31,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769f75a30/408f27644666432b9a19c47999ffa298/FLAG3b7ae60c3 [2022-04-27 22:40:31,968 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:40:31,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/freire2.c [2022-04-27 22:40:31,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769f75a30/408f27644666432b9a19c47999ffa298/FLAG3b7ae60c3 [2022-04-27 22:40:32,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769f75a30/408f27644666432b9a19c47999ffa298 [2022-04-27 22:40:32,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:40:32,411 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:40:32,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:40:32,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:40:32,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:40:32,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724d481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32, skipping insertion in model container [2022-04-27 22:40:32,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:40:32,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:40:32,570 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/freire2.c[709,722] [2022-04-27 22:40:32,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:40:32,623 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:40:32,636 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/freire2.c[709,722] [2022-04-27 22:40:32,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:40:32,659 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:40:32,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32 WrapperNode [2022-04-27 22:40:32,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:40:32,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:40:32,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:40:32,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:40:32,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:40:32,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:40:32,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:40:32,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:40:32,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:40:32,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:40:32,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:40:32,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:40:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:40:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:40:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:40:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:40:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:40:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:40:32,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:40:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:40:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:40:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:40:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-27 22:40:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:40:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:40:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:40:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:40:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:40:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:40:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:40:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:40:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:40:32,804 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:40:32,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:40:32,921 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:40:32,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:40:32,927 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:40:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:40:32 BoogieIcfgContainer [2022-04-27 22:40:32,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:40:32,929 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:40:32,929 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:40:32,930 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:40:32,942 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:40:32" (1/1) ... [2022-04-27 22:40:32,944 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:40:32,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:40:32 BasicIcfg [2022-04-27 22:40:32,972 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:40:32,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:40:32,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:40:32,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:40:32,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:40:32" (1/4) ... [2022-04-27 22:40:32,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abfa12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:40:32, skipping insertion in model container [2022-04-27 22:40:32,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:32" (2/4) ... [2022-04-27 22:40:32,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abfa12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:40:32, skipping insertion in model container [2022-04-27 22:40:32,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:40:32" (3/4) ... [2022-04-27 22:40:32,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abfa12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:40:32, skipping insertion in model container [2022-04-27 22:40:32,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:40:32" (4/4) ... [2022-04-27 22:40:32,991 INFO L111 eAbstractionObserver]: Analyzing ICFG freire2.cqvasr [2022-04-27 22:40:33,007 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:40:33,008 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:40:33,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:40:33,052 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@359d1914, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52a0b2e2 [2022-04-27 22:40:33,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:40:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:40:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 22:40:33,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:40:33,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:40:33,066 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:40:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:40:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash 637070135, now seen corresponding path program 1 times [2022-04-27 22:40:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:40:33,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837370410] [2022-04-27 22:40:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:40:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:40:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:40:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:40:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:40:33,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] 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] {28#true} is VALID [2022-04-27 22:40:33,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 22:40:33,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 22:40:33,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:40:33,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] 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] {28#true} is VALID [2022-04-27 22:40:33,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 22:40:33,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 22:40:33,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 22:40:33,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [72] mainENTRY-->L32-2: Formula: (and (= v_main_~r~0_2 1) (= v_main_~a~0_1 v_main_~x~0_1) (= v_main_~a~0_1 |v_main_#t~nondet4_2|) (= v_main_~s~0_1 (/ 13.0 4.0))) 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_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~r~0, main_~s~0, main_~a~0] {28#true} is VALID [2022-04-27 22:40:33,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [74] L32-2-->L32-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 22:40:33,268 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} [77] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_~convertDOUBLEToINT_13 (* (- 1) (* v_main_~r~0_12 (* v_main_~r~0_12 12)))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[v_~convertDOUBLEToINT_13] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {29#false} is VALID [2022-04-27 22:40:33,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} [80] __VERIFIER_assertENTRY-->L17: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#false} is VALID [2022-04-27 22:40:33,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} [83] L17-->L18: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 22:40:33,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [87] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 22:40:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:40:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:40:33,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837370410] [2022-04-27 22:40:33,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837370410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:40:33,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:40:33,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:40:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770777408] [2022-04-27 22:40:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:40:33,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 22:40:33,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:40:33,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:40:33,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:40:33,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:40:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:40:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:40:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:40:33,336 INFO L87 Difference]: Start difference. First operand has 25 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:40:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:33,499 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2022-04-27 22:40:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:40:33,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 22:40:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:40:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:40:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 22:40:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:40:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 22:40:33,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-27 22:40:33,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:40:33,596 INFO L225 Difference]: With dead ends: 44 [2022-04-27 22:40:33,596 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 22:40:33,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:40:33,602 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:40:33,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:40:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 22:40:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 22:40:33,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:40:33,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:40:33,629 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:40:33,629 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:40:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:33,633 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-27 22:40:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 22:40:33,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:33,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:33,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 20 states. [2022-04-27 22:40:33,635 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 20 states. [2022-04-27 22:40:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:33,638 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-27 22:40:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 22:40:33,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:33,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:33,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:40:33,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:40:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:40:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-27 22:40:33,643 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2022-04-27 22:40:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:40:33,643 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-27 22:40:33,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:40:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 22:40:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 22:40:33,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:40:33,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:40:33,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:40:33,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:40:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:40:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash 638946968, now seen corresponding path program 1 times [2022-04-27 22:40:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:40:33,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173919284] [2022-04-27 22:40:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:40:33,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:40:33,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:40:33,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212039041] [2022-04-27 22:40:33,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:40:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:40:33,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:40:33,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:40:33,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:40:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 22:40:33,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 22:40:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 22:40:33,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 22:40:33,769 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 22:40:33,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:40:33,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 22:40:33,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:40:33,995 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 22:40:33,997 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:40:34,013 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 22:40:34,013 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 22:40:34,013 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 22:40:34,013 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 22:40:34,013 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 22:40:34,014 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 22:40:34,015 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 22:40:34,016 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 22:40:34,016 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 22:40:34,016 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 22:40:34,016 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 22:40:34,016 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:40:34,016 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:40:34,016 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:40:34,016 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-27 22:40:34,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:40:34 BasicIcfg [2022-04-27 22:40:34,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:40:34,018 INFO L158 Benchmark]: Toolchain (without parser) took 1607.13ms. Allocated memory was 203.4MB in the beginning and 284.2MB in the end (delta: 80.7MB). Free memory was 144.9MB in the beginning and 192.3MB in the end (delta: -47.3MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. [2022-04-27 22:40:34,018 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:40:34,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.52ms. Allocated memory was 203.4MB in the beginning and 284.2MB in the end (delta: 80.7MB). Free memory was 144.8MB in the beginning and 253.6MB in the end (delta: -108.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-27 22:40:34,019 INFO L158 Benchmark]: Boogie Preprocessor took 27.48ms. Allocated memory is still 284.2MB. Free memory was 253.6MB in the beginning and 252.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:40:34,020 INFO L158 Benchmark]: RCFGBuilder took 239.26ms. Allocated memory is still 284.2MB. Free memory was 252.0MB in the beginning and 240.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 22:40:34,020 INFO L158 Benchmark]: IcfgTransformer took 43.41ms. Allocated memory is still 284.2MB. Free memory was 240.0MB in the beginning and 238.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:40:34,021 INFO L158 Benchmark]: TraceAbstraction took 1031.64ms. Allocated memory is still 284.2MB. Free memory was 238.4MB in the beginning and 192.3MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-04-27 22:40:34,023 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.12ms. Allocated memory is still 203.4MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.52ms. Allocated memory was 203.4MB in the beginning and 284.2MB in the end (delta: 80.7MB). Free memory was 144.8MB in the beginning and 253.6MB in the end (delta: -108.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.48ms. Allocated memory is still 284.2MB. Free memory was 253.6MB in the beginning and 252.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 239.26ms. Allocated memory is still 284.2MB. Free memory was 252.0MB in the beginning and 240.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 43.41ms. Allocated memory is still 284.2MB. Free memory was 240.0MB in the beginning and 238.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1031.64ms. Allocated memory is still 284.2MB. Free memory was 238.4MB in the beginning and 192.3MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. 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. Possible FailurePath: [L25] int r; [L26] double a, x, s; [L27] a = __VERIFIER_nondet_double() [L28] x = a [L29] s = 3.25 [L30] r = 1 VAL [a=2, r=1, s=13/4, x=2] [L32] COND TRUE 1 VAL [a=2, r=1, s=13/4, x=2] [L33] CALL __VERIFIER_assert((int)(4*s) - 12*r*r == 1) 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 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 24 mSDtfsCounter, 8 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=25occurred 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.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 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-27 22:40:34,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...