/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_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:10:51,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:10:51,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:10:51,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:10:51,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:10:51,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:10:51,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:10:51,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:10:51,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:10:51,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:10:51,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:10:51,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:10:51,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:10:51,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:10:51,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:10:51,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:10:51,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:10:51,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:10:51,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:10:51,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:10:51,643 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:10:51,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:10:51,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:10:51,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:10:51,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:10:51,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:10:51,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:10:51,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:10:51,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:10:51,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:10:51,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:10:51,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:10:51,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:10:51,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:10:51,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:10:51,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:10:51,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:10:51,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:10:51,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:10:51,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:10:51,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:10:51,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:10:51,669 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:10:51,698 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:10:51,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:10:51,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:10:51,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:10:51,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:10:51,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:10:51,701 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:10:51,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:10:51,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:10:51,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:10:51,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:10:51,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:10:51,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:10:51,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:10:51,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:10:51,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:10:51,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:10:51,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:10:51,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:10:51,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:10:51,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:10:51,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:10:51,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:10:51,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:10:51,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:10:51,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:10:51,705 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:10:51,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:10:51,706 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:10:51,706 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:10:51,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:10:51,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:10:51,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:10:51,962 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:10:51,963 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:10:51,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound2.c [2022-04-15 03:10:52,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b69a73f/6218ba9b67094310a53939a9575be734/FLAG6730fc6cc [2022-04-15 03:10:52,457 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:10:52,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound2.c [2022-04-15 03:10:52,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b69a73f/6218ba9b67094310a53939a9575be734/FLAG6730fc6cc [2022-04-15 03:10:52,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b69a73f/6218ba9b67094310a53939a9575be734 [2022-04-15 03:10:52,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:10:52,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:10:52,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:10:52,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:10:52,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:10:52,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebfef7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52, skipping insertion in model container [2022-04-15 03:10:52,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:10:52,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:10:52,730 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_unwindbound2.c[712,725] [2022-04-15 03:10:52,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:10:52,766 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:10:52,780 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_unwindbound2.c[712,725] [2022-04-15 03:10:52,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:10:52,801 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:10:52,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52 WrapperNode [2022-04-15 03:10:52,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:10:52,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:10:52,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:10:52,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:10:52,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:10:52,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:10:52,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:10:52,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:10:52,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (1/1) ... [2022-04-15 03:10:52,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:10:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:10:52,881 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:10:52,901 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:10:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:10:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:10:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:10:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:10:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:10:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:10:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:10:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:10:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-15 03:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:10:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:10:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:10:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:10:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:10:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:10:52,988 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:10:52,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:10:53,146 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:10:53,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:10:53,162 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:10:53,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:10:53 BoogieIcfgContainer [2022-04-15 03:10:53,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:10:53,166 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:10:53,166 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:10:53,172 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:10:53,175 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:10:53" (1/1) ... [2022-04-15 03:10:53,176 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:10:53,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:10:53 BasicIcfg [2022-04-15 03:10:53,203 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:10:53,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:10:53,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:10:53,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:10:53,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:10:52" (1/4) ... [2022-04-15 03:10:53,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5618a36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:10:53, skipping insertion in model container [2022-04-15 03:10:53,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:52" (2/4) ... [2022-04-15 03:10:53,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5618a36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:10:53, skipping insertion in model container [2022-04-15 03:10:53,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:10:53" (3/4) ... [2022-04-15 03:10:53,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5618a36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:10:53, skipping insertion in model container [2022-04-15 03:10:53,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:10:53" (4/4) ... [2022-04-15 03:10:53,209 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound2.cqvasr [2022-04-15 03:10:53,213 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:10:53,213 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:10:53,249 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:10:53,255 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:10:53,255 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:10:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:10:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 03:10:53,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:10:53,278 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:10:53,279 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:10:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:10:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times [2022-04-15 03:10:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:10:53,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203210629] [2022-04-15 03:10:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:10:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:10:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:10:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 03:10:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:10:53,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 03:10:53,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:10:53,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:10:53,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 03:10:53,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 03:10:53,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:10:53,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:10:53,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:10:53,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [61] mainENTRY-->L32-3: Formula: (and (= v_main_~r~0_1 0) (= 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] {25#true} is VALID [2022-04-15 03:10:53,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [63] L32-3-->L32-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 03:10:53,525 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [65] L32-4-->__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] {26#false} is VALID [2022-04-15 03:10:53,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [69] __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] {26#false} is VALID [2022-04-15 03:10:53,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [72] 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[] {26#false} is VALID [2022-04-15 03:10:53,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [76] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 03:10:53,526 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:10:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:10:53,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203210629] [2022-04-15 03:10:53,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203210629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:10:53,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:10:53,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 03:10:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739238482] [2022-04-15 03:10:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:10:53,535 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-15 03:10:53,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:10:53,539 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-15 03:10:53,566 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-15 03:10:53,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 03:10:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:10:53,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 03:10:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 03:10:53,586 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-15 03:10:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:10:53,692 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 03:10:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 03:10:53,693 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-15 03:10:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:10:53,695 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-15 03:10:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 03:10:53,705 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-15 03:10:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 03:10:53,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-15 03:10:53,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:10:53,786 INFO L225 Difference]: With dead ends: 39 [2022-04-15 03:10:53,787 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 03:10:53,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 03:10:53,795 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:10:53,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:10:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 03:10:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 03:10:53,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:10:53,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:53,831 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:53,832 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:10:53,837 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 03:10:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 03:10:53,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:10:53,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:10:53,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-15 03:10:53,838 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-15 03:10:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:10:53,844 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 03:10:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 03:10:53,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:10:53,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:10:53,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:10:53,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:10:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 03:10:53,850 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 03:10:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:10:53,853 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 03:10:53,859 INFO L479 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-15 03:10:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 03:10:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 03:10:53,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:10:53,861 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:10:53,861 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 03:10:53,862 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:10:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:10:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times [2022-04-15 03:10:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:10:53,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110301828] [2022-04-15 03:10:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:10:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:10:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:10:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 03:10:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:10:53,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:53,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#(= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:53,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151#(= ~counter~0 0)} {146#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:54,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 03:10:54,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:54,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#(= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:54,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151#(= ~counter~0 0)} {146#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:54,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {151#(= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:54,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#(= ~counter~0 0)} [61] mainENTRY-->L32-3: Formula: (and (= v_main_~r~0_1 0) (= 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] {151#(= ~counter~0 0)} is VALID [2022-04-15 03:10:54,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(= ~counter~0 0)} [64] L32-3-->L32-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {152#(= |main_#t~post5| 0)} is VALID [2022-04-15 03:10:54,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(= |main_#t~post5| 0)} [66] L32-1-->L32-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {147#false} is VALID [2022-04-15 03:10:54,010 INFO L272 TraceCheckUtils]: 8: Hoare triple {147#false} [65] L32-4-->__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] {147#false} is VALID [2022-04-15 03:10:54,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#false} [69] __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] {147#false} is VALID [2022-04-15 03:10:54,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {147#false} [72] 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[] {147#false} is VALID [2022-04-15 03:10:54,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} [76] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-15 03:10:54,011 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:10:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:10:54,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110301828] [2022-04-15 03:10:54,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110301828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:10:54,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:10:54,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:10:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507762556] [2022-04-15 03:10:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:10:54,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 12 [2022-04-15 03:10:54,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:10:54,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:10:54,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:10:54,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:10:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:10:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:10:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:10:54,030 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:10:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:10:54,149 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 03:10:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 03:10:54,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 12 [2022-04-15 03:10:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:10:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:10:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 03:10:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:10:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 03:10:54,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-15 03:10:54,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:10:54,188 INFO L225 Difference]: With dead ends: 26 [2022-04-15 03:10:54,188 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 03:10:54,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 03:10:54,189 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:10:54,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:10:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 03:10:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 03:10:54,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:10:54,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:54,193 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:54,194 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:10:54,195 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 03:10:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:10:54,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:10:54,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:10:54,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 03:10:54,196 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 03:10:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:10:54,197 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 03:10:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:10:54,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:10:54,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:10:54,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:10:54,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:10:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:10:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 03:10:54,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-15 03:10:54,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:10:54,208 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 03:10:54,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:10:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:10:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 03:10:54,209 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:10:54,209 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:10:54,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 03:10:54,209 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:10:54,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:10:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times [2022-04-15 03:10:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:10:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204606941] [2022-04-15 03:10:54,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:10:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:10:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:10:54,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 03:10:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:10:54,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 03:10:54,293 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 03:10:54,294 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:10:54,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 03:10:54,299 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-15 03:10:54,302 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:10:54,338 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 03:10:54,338 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-15 03:10:54,339 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 03:10:54,343 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 03:10:54,343 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:10:54,344 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:10:54,344 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:10:54,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:10:54 BasicIcfg [2022-04-15 03:10:54,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:10:54,347 INFO L158 Benchmark]: Toolchain (without parser) took 1853.95ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 130.5MB in the beginning and 126.7MB in the end (delta: 3.7MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. [2022-04-15 03:10:54,347 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 147.0MB in the beginning and 146.9MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:10:54,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.31ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 130.3MB in the beginning and 197.0MB in the end (delta: -66.7MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-15 03:10:54,356 INFO L158 Benchmark]: Boogie Preprocessor took 46.63ms. Allocated memory is still 219.2MB. Free memory was 197.0MB in the beginning and 195.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:10:54,356 INFO L158 Benchmark]: RCFGBuilder took 312.87ms. Allocated memory is still 219.2MB. Free memory was 195.3MB in the beginning and 184.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 03:10:54,357 INFO L158 Benchmark]: IcfgTransformer took 37.92ms. Allocated memory is still 219.2MB. Free memory was 184.8MB in the beginning and 183.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:10:54,357 INFO L158 Benchmark]: TraceAbstraction took 1140.82ms. Allocated memory is still 219.2MB. Free memory was 182.7MB in the beginning and 126.7MB in the end (delta: 56.0MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-04-15 03:10:54,362 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.09ms. Allocated memory is still 182.5MB. Free memory was 147.0MB in the beginning and 146.9MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.31ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 130.3MB in the beginning and 197.0MB in the end (delta: -66.7MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.63ms. Allocated memory is still 219.2MB. Free memory was 197.0MB in the beginning and 195.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 312.87ms. Allocated memory is still 219.2MB. Free memory was 195.3MB in the beginning and 184.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 37.92ms. Allocated memory is still 219.2MB. Free memory was 184.8MB in the beginning and 183.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1140.82ms. Allocated memory is still 219.2MB. Free memory was 182.7MB in the beginning and 126.7MB in the end (delta: 56.0MB). Peak memory consumption was 55.6MB. 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 someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; VAL [\old(counter)=53, counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [\old(counter)=0, a=50, counter=0, r=0] [L32] EXPR counter++ VAL [\old(counter)=0, a=50, counter=1, counter++=0, r=0] [L32] COND TRUE counter++<2 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, 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, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 40 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-15 03:10:54,409 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...