./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_1_5.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_3+newton_1_5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c1372ae8683a9b181ceb7919574ebc960da9cc935a490e3fb100e7f3b19512c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:33:31,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:33:31,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:33:31,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:33:31,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:33:31,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:33:31,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:33:31,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:33:31,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:33:31,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:33:31,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:33:31,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:33:31,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:33:31,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:33:31,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:33:31,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:33:31,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:33:31,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:33:31,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:33:31,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:33:31,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:33:31,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:33:31,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:33:31,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:33:31,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:33:31,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:33:31,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:33:31,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:33:31,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:33:31,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:33:31,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:33:31,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:33:31,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:33:31,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:33:31,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:33:31,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:33:31,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:33:31,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:33:31,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:33:31,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:33:31,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:33:31,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:33:31,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:33:31,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:33:31,608 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:33:31,608 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:33:31,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:33:31,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:33:31,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:33:31,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:33:31,610 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:33:31,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:33:31,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:33:31,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:33:31,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:33:31,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:33:31,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:33:31,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:33:31,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:33:31,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:33:31,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:33:31,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:33:31,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:33:31,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:33:31,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:33:31,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:33:31,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:33:31,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:33:31,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:33:31,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:33:31,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:33:31,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:33:31,614 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:33:31,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:33:31,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:33:31,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c1372ae8683a9b181ceb7919574ebc960da9cc935a490e3fb100e7f3b19512c [2022-02-20 19:33:31,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:33:31,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:33:31,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:33:31,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:33:31,831 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:33:31,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_1_5.i [2022-02-20 19:33:31,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/359684116/0929a80d914248f0ac750be50f69b2b9/FLAGa30da474f [2022-02-20 19:33:32,224 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:33:32,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i [2022-02-20 19:33:32,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/359684116/0929a80d914248f0ac750be50f69b2b9/FLAGa30da474f [2022-02-20 19:33:32,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/359684116/0929a80d914248f0ac750be50f69b2b9 [2022-02-20 19:33:32,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:33:32,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:33:32,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:33:32,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:33:32,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:33:32,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e096c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32, skipping insertion in model container [2022-02-20 19:33:32,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:33:32,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:33:32,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[1226,1239] [2022-02-20 19:33:32,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[2820,2833] [2022-02-20 19:33:32,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:33:32,411 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:33:32,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[1226,1239] [2022-02-20 19:33:32,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[2820,2833] [2022-02-20 19:33:32,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:33:32,447 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:33:32,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32 WrapperNode [2022-02-20 19:33:32,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:33:32,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:33:32,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:33:32,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:33:32,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,481 INFO L137 Inliner]: procedures = 27, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 78 [2022-02-20 19:33:32,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:33:32,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:33:32,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:33:32,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:33:32,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:33:32,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:33:32,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:33:32,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:33:32,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (1/1) ... [2022-02-20 19:33:32,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:33:32,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:33:32,536 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-02-20 19:33:32,538 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-02-20 19:33:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:33:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:33:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:33:32,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:33:32,607 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:33:32,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:33:32,781 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:33:32,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:33:32,785 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:33:32,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:33:32 BoogieIcfgContainer [2022-02-20 19:33:32,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:33:32,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:33:32,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:33:32,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:33:32,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:33:32" (1/3) ... [2022-02-20 19:33:32,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cf7876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:33:32, skipping insertion in model container [2022-02-20 19:33:32,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:32" (2/3) ... [2022-02-20 19:33:32,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cf7876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:33:32, skipping insertion in model container [2022-02-20 19:33:32,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:33:32" (3/3) ... [2022-02-20 19:33:32,808 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_1_5.i [2022-02-20 19:33:32,811 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:33:32,811 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:33:32,854 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:33:32,868 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:33:32,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:33:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:33:32,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:33:32,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:33:32,891 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:33:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:33:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 447749113, now seen corresponding path program 1 times [2022-02-20 19:33:32,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:33:32,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293619489] [2022-02-20 19:33:32,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:33:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:33:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:33:33,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-20 19:33:33,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {30#true} is VALID [2022-02-20 19:33:33,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume !(0 != main_#t~nondet11#1);havoc main_#t~nondet11#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet8#1, main2_#t~ret9#1, main2_#t~ret10#1, main2_~IN~0#1, main2_~x~1#1;main2_~IN~0#1 := main2_#t~nondet8#1;havoc main2_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main2_~IN~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(main2_~IN~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {30#true} is VALID [2022-02-20 19:33:33,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {31#false} is VALID [2022-02-20 19:33:33,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main2_~IN~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, f_~x#1), f_~x#1), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), 5040.0)); {31#false} is VALID [2022-02-20 19:33:33,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} main2_#t~ret9#1 := f_#res#1;assume { :end_inline_f } true;assume { :begin_inline_fp } true;fp_#in~x#1 := main2_~IN~0#1;havoc fp_#res#1;havoc fp_~x#1;fp_~x#1 := fp_#in~x#1;fp_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fp_~x#1, fp_~x#1), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), 720.0)); {31#false} is VALID [2022-02-20 19:33:33,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} main2_#t~ret10#1 := fp_#res#1;assume { :end_inline_fp } true;main2_~x~1#1 := ~someBinaryArithmeticFLOAToperation(main2_~IN~0#1, ~someBinaryArithmeticFLOAToperation(main2_#t~ret9#1, main2_#t~ret10#1));havoc main2_#t~ret9#1;havoc main2_#t~ret10#1; {31#false} is VALID [2022-02-20 19:33:33,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume !~someBinaryDOUBLEComparisonOperation(main2_~x~1#1, 0.1); {31#false} is VALID [2022-02-20 19:33:33,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 19:33:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:33:33,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:33:33,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293619489] [2022-02-20 19:33:33,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293619489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:33:33,076 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:33:33,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:33:33,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710711356] [2022-02-20 19:33:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:33:33,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:33:33,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:33:33,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:33:33,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:33:33,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:33:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:33:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:33:33,133 INFO L87 Difference]: Start difference. First operand has 27 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:33:33,172 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 19:33:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:33:33,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:33:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:33:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2022-02-20 19:33:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2022-02-20 19:33:33,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2022-02-20 19:33:33,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:33:33,251 INFO L225 Difference]: With dead ends: 47 [2022-02-20 19:33:33,252 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 19:33:33,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:33:33,257 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:33:33,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:33:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 19:33:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 19:33:33,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:33:33,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,277 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,277 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:33:33,278 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-20 19:33:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 19:33:33,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:33:33,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:33:33,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 19:33:33,280 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 19:33:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:33:33,281 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-20 19:33:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 19:33:33,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:33:33,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:33:33,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:33:33,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:33:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-20 19:33:33,283 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-02-20 19:33:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:33:33,284 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-20 19:33:33,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 19:33:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:33:33,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:33:33,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:33:33,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:33:33,285 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:33:33,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:33:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash 505007415, now seen corresponding path program 1 times [2022-02-20 19:33:33,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:33:33,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169001420] [2022-02-20 19:33:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:33:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:33:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:33:33,302 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:33:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:33:33,319 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:33:33,320 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:33:33,321 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:33:33,322 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:33:33,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:33:33,324 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 19:33:33,326 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:33:33,342 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 19:33:33,342 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 19:33:33,343 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:33:33,343 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:33:33,343 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 19:33:33,343 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 19:33:33,343 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 19:33:33,344 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 19:33:33,345 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 19:33:33,345 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 19:33:33,345 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 19:33:33,345 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 19:33:33,345 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 19:33:33,345 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 19:33:33,345 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L101-2 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 19:33:33,346 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 19:33:33,347 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 19:33:33,347 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-02-20 19:33:33,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 07:33:33 BoogieIcfgContainer [2022-02-20 19:33:33,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 19:33:33,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 19:33:33,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 19:33:33,349 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 19:33:33,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:33:32" (3/4) ... [2022-02-20 19:33:33,351 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 19:33:33,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 19:33:33,353 INFO L158 Benchmark]: Toolchain (without parser) took 1110.38ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 73.1MB in the beginning and 76.2MB in the end (delta: -3.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-02-20 19:33:33,354 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:33:33,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.75ms. Allocated memory is still 102.8MB. Free memory was 72.9MB in the beginning and 75.2MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 19:33:33,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.24ms. Allocated memory is still 102.8MB. Free memory was 75.2MB in the beginning and 72.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:33:33,358 INFO L158 Benchmark]: Boogie Preprocessor took 16.28ms. Allocated memory is still 102.8MB. Free memory was 72.9MB in the beginning and 71.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:33:33,358 INFO L158 Benchmark]: RCFGBuilder took 298.27ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 58.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 19:33:33,358 INFO L158 Benchmark]: TraceAbstraction took 550.29ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 58.1MB in the beginning and 76.2MB in the end (delta: -18.0MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-02-20 19:33:33,359 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 123.7MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:33:33,363 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.15ms. Allocated memory is still 102.8MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.75ms. Allocated memory is still 102.8MB. Free memory was 72.9MB in the beginning and 75.2MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.24ms. Allocated memory is still 102.8MB. Free memory was 75.2MB in the beginning and 72.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.28ms. Allocated memory is still 102.8MB. Free memory was 72.9MB in the beginning and 71.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.27ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 58.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 550.29ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 58.1MB in the beginning and 76.2MB in the end (delta: -18.0MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 123.7MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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: 102]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L75] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L93] CALL, EXPR f(IN) [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=49, x=49] [L93] RET, EXPR f(IN) [L93] CALL, EXPR fp(IN) [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=49, x=49] [L93] RET, EXPR fp(IN) [L93] float x = IN - f(IN)/fp(IN); [L101] COND TRUE !(x < 0.1) VAL [IN=49] [L102] reach_error() VAL [IN=49] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 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-02-20 19:33:33,407 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_3+newton_1_5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c1372ae8683a9b181ceb7919574ebc960da9cc935a490e3fb100e7f3b19512c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:33:34,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:33:34,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:33:35,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:33:35,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:33:35,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:33:35,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:33:35,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:33:35,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:33:35,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:33:35,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:33:35,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:33:35,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:33:35,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:33:35,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:33:35,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:33:35,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:33:35,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:33:35,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:33:35,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:33:35,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:33:35,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:33:35,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:33:35,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:33:35,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:33:35,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:33:35,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:33:35,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:33:35,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:33:35,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:33:35,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:33:35,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:33:35,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:33:35,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:33:35,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:33:35,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:33:35,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:33:35,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:33:35,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:33:35,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:33:35,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:33:35,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:33:35,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:33:35,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:33:35,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:33:35,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:33:35,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:33:35,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:33:35,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:33:35,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:33:35,096 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:33:35,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:33:35,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:33:35,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:33:35,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:33:35,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:33:35,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:33:35,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:33:35,098 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:33:35,098 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:33:35,098 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:33:35,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:33:35,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:33:35,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:33:35,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:33:35,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:33:35,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:33:35,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:33:35,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:33:35,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:33:35,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:33:35,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:33:35,100 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:33:35,100 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:33:35,100 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:33:35,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:33:35,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:33:35,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:33:35,101 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c1372ae8683a9b181ceb7919574ebc960da9cc935a490e3fb100e7f3b19512c [2022-02-20 19:33:35,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:33:35,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:33:35,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:33:35,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:33:35,360 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:33:35,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_1_5.i [2022-02-20 19:33:35,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0110d6a/74355fc6350f46388bad52b2226a2574/FLAGa1da0c416 [2022-02-20 19:33:35,806 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:33:35,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i [2022-02-20 19:33:35,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0110d6a/74355fc6350f46388bad52b2226a2574/FLAGa1da0c416 [2022-02-20 19:33:35,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0110d6a/74355fc6350f46388bad52b2226a2574 [2022-02-20 19:33:35,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:33:35,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:33:35,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:33:35,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:33:35,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:33:35,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:33:35" (1/1) ... [2022-02-20 19:33:35,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bf4b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:35, skipping insertion in model container [2022-02-20 19:33:35,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:33:35" (1/1) ... [2022-02-20 19:33:35,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:33:35,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:33:35,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[1226,1239] [2022-02-20 19:33:36,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[2820,2833] [2022-02-20 19:33:36,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:33:36,066 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:33:36,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[1226,1239] [2022-02-20 19:33:36,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_1_5.i[2820,2833] [2022-02-20 19:33:36,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:33:36,093 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:33:36,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36 WrapperNode [2022-02-20 19:33:36,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:33:36,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:33:36,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:33:36,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:33:36,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,141 INFO L137 Inliner]: procedures = 28, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 73 [2022-02-20 19:33:36,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:33:36,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:33:36,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:33:36,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:33:36,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:33:36,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:33:36,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:33:36,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:33:36,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (1/1) ... [2022-02-20 19:33:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:33:36,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:33:36,205 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-02-20 19:33:36,220 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-02-20 19:33:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:33:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:33:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:33:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:33:36,290 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:33:36,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:33:42,030 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:33:42,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:33:42,035 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:33:42,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:33:42 BoogieIcfgContainer [2022-02-20 19:33:42,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:33:42,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:33:42,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:33:42,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:33:42,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:33:35" (1/3) ... [2022-02-20 19:33:42,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9cc98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:33:42, skipping insertion in model container [2022-02-20 19:33:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:33:36" (2/3) ... [2022-02-20 19:33:42,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9cc98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:33:42, skipping insertion in model container [2022-02-20 19:33:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:33:42" (3/3) ... [2022-02-20 19:33:42,041 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_1_5.i [2022-02-20 19:33:42,044 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:33:42,044 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:33:42,078 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:33:42,082 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:33:42,083 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:33:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:33:42,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:33:42,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:33:42,096 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:33:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:33:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 447749113, now seen corresponding path program 1 times [2022-02-20 19:33:42,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:33:42,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752130810] [2022-02-20 19:33:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:33:42,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:33:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:33:42,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:33:42,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 19:33:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:33:43,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 19:33:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:33:43,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:33:43,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {30#true} is VALID [2022-02-20 19:33:43,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1; {30#true} is VALID [2022-02-20 19:33:43,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume !(0bv32 != main_#t~nondet11#1);havoc main_#t~nondet11#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet8#1, main2_#t~ret9#1, main2_#t~ret10#1, main2_~IN~0#1, main2_~x~1#1;main2_~IN~0#1 := main2_#t~nondet8#1;havoc main2_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.gt~FLOAT(main2_~IN~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0))) && ~fp.lt~FLOAT(main2_~IN~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {30#true} is VALID [2022-02-20 19:33:43,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {31#false} is VALID [2022-02-20 19:33:43,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main2_~IN~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.add~FLOAT(currentRoundingMode, ~fp.sub~FLOAT(currentRoundingMode, f_~x#1, ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, f_~x#1, f_~x#1), f_~x#1), ~to_fp~FLOAT(currentRoundingMode, 6.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), ~to_fp~FLOAT(currentRoundingMode, 120.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), ~to_fp~FLOAT(currentRoundingMode, 5040.0))); {31#false} is VALID [2022-02-20 19:33:43,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} main2_#t~ret9#1 := f_#res#1;assume { :end_inline_f } true;assume { :begin_inline_fp } true;fp_#in~x#1 := main2_~IN~0#1;havoc fp_#res#1;havoc fp_~x#1;fp_~x#1 := fp_#in~x#1;fp_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.add~FLOAT(currentRoundingMode, ~fp.sub~FLOAT(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fp_~x#1, fp_~x#1), ~to_fp~FLOAT(currentRoundingMode, 2.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), ~to_fp~FLOAT(currentRoundingMode, 24.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), ~to_fp~FLOAT(currentRoundingMode, 720.0))); {31#false} is VALID [2022-02-20 19:33:43,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} main2_#t~ret10#1 := fp_#res#1;assume { :end_inline_fp } true;main2_~x~1#1 := ~fp.sub~FLOAT(currentRoundingMode, main2_~IN~0#1, ~fp.div~FLOAT(currentRoundingMode, main2_#t~ret9#1, main2_#t~ret10#1));havoc main2_#t~ret9#1;havoc main2_#t~ret10#1; {31#false} is VALID [2022-02-20 19:33:43,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main2_~x~1#1), ~to_fp~DOUBLE(currentRoundingMode, 0.1)); {31#false} is VALID [2022-02-20 19:33:43,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 19:33:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:33:43,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:33:43,128 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:33:43,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752130810] [2022-02-20 19:33:43,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752130810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:33:43,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:33:43,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:33:43,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543861124] [2022-02-20 19:33:43,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:33:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:33:43,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:33:43,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:45,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:33:45,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:33:45,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:33:45,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:33:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:33:45,100 INFO L87 Difference]: Start difference. First operand has 27 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:33:51,345 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 19:33:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:33:51,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:33:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:33:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2022-02-20 19:33:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2022-02-20 19:33:51,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2022-02-20 19:33:55,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:33:55,451 INFO L225 Difference]: With dead ends: 47 [2022-02-20 19:33:55,451 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 19:33:55,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:33:55,457 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:33:55,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:33:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 19:33:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 19:33:55,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:33:55,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:55,481 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:55,481 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:33:55,483 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-20 19:33:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 19:33:55,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:33:55,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:33:55,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 19:33:55,485 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 19:33:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:33:55,489 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-20 19:33:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 19:33:55,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:33:55,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:33:55,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:33:55,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:33:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-20 19:33:55,493 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-02-20 19:33:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:33:55,494 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-20 19:33:55,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:33:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 19:33:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:33:55,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:33:55,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:33:55,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 19:33:55,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:33:55,712 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:33:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:33:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 505007415, now seen corresponding path program 1 times [2022-02-20 19:33:55,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:33:55,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273810730] [2022-02-20 19:33:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:33:55,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:33:55,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:33:55,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:33:55,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 19:34:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:34:30,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:34:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:34:45,718 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:34:45,718 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:34:45,719 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:34:45,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:34:45,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 19:34:45,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:34:45,924 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 19:34:45,926 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:34:45,952 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 19:34:45,955 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 19:34:45,955 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:34:45,955 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:34:45,955 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 19:34:45,955 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 19:34:45,955 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 19:34:45,956 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L101-2 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:34:45,957 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 19:34:45,958 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 19:34:45,958 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-02-20 19:34:45,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 07:34:45 BoogieIcfgContainer [2022-02-20 19:34:45,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 19:34:45,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 19:34:45,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 19:34:45,961 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 19:34:45,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:33:42" (3/4) ... [2022-02-20 19:34:45,963 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 19:34:45,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 19:34:46,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 19:34:46,002 INFO L158 Benchmark]: Toolchain (without parser) took 70173.05ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 27.4MB in the end (delta: 10.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 19:34:46,004 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 44.0MB. Free memory was 26.1MB in the beginning and 26.1MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:34:46,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.46ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 73.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 19:34:46,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.72ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:34:46,005 INFO L158 Benchmark]: Boogie Preprocessor took 41.46ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 33.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:34:46,005 INFO L158 Benchmark]: RCFGBuilder took 5851.46ms. Allocated memory is still 56.6MB. Free memory was 33.7MB in the beginning and 36.1MB in the end (delta: -2.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-02-20 19:34:46,005 INFO L158 Benchmark]: TraceAbstraction took 63922.72ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 29.6MB in the end (delta: 5.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-02-20 19:34:46,006 INFO L158 Benchmark]: Witness Printer took 41.05ms. Allocated memory is still 56.6MB. Free memory was 29.6MB in the beginning and 27.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:34:46,009 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.17ms. Allocated memory is still 44.0MB. Free memory was 26.1MB in the beginning and 26.1MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.46ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 73.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.72ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.46ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 33.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 5851.46ms. Allocated memory is still 56.6MB. Free memory was 33.7MB in the beginning and 36.1MB in the end (delta: -2.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 63922.72ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 29.6MB in the end (delta: 5.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 41.05ms. Allocated memory is still 56.6MB. Free memory was 29.6MB in the beginning and 27.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 102]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L75] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L93] CALL, EXPR f(IN) [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.7001767754554749, \result=-0.644385576248169, x=-0.7001767754554749] [L93] RET, EXPR f(IN) [L93] CALL, EXPR fp(IN) [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.7001767754554749, \result=0.7650542259216309, x=-0.7001767754554749] [L93] RET, EXPR fp(IN) [L93] float x = IN - f(IN)/fp(IN); [L101] COND TRUE !(x < 0.1) VAL [IN=-0.7001767754554749, x=0.1420975923538208] [L102] reach_error() VAL [IN=-0.7001767754554749, x=0.1420975923538208] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 63.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 35.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 30 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 19:34:46,185 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE