./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/nla-digbench-scaling/freire1_unwindbound10.c -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 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 16:08:08,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 16:08:08,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 16:08:08,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 16:08:08,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 16:08:08,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 16:08:08,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 16:08:08,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 16:08:08,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 16:08:08,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 16:08:08,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 16:08:08,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 16:08:08,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 16:08:08,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 16:08:08,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 16:08:08,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 16:08:08,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 16:08:08,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 16:08:08,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 16:08:08,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 16:08:08,850 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 16:08:08,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 16:08:08,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 16:08:08,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 16:08:08,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 16:08:08,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 16:08:08,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 16:08:08,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 16:08:08,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 16:08:08,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 16:08:08,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 16:08:08,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 16:08:08,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 16:08:08,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 16:08:08,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 16:08:08,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 16:08:08,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 16:08:08,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 16:08:08,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 16:08:08,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 16:08:08,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 16:08:08,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 16:08:08,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 16:08:08,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 16:08:08,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 16:08:08,889 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 16:08:08,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 16:08:08,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 16:08:08,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 16:08:08,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 16:08:08,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 16:08:08,891 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 16:08:08,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 16:08:08,891 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 16:08:08,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 16:08:08,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 16:08:08,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 16:08:08,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 16:08:08,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 16:08:08,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 16:08:08,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 16:08:08,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 16:08:08,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 16:08:08,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 16:08:08,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 16:08:08,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 16:08:08,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 16:08:08,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:08:08,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 16:08:08,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 16:08:08,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 16:08:08,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 16:08:08,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 16:08:08,895 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 16:08:08,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 16:08:08,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 16:08:08,896 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 -> 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 [2022-07-22 16:08:09,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 16:08:09,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 16:08:09,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 16:08:09,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 16:08:09,129 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 16:08:09,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-22 16:08:09,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e4b8f45/d76492e2c44f422d99b5f24d79578ce2/FLAGa8b7b951b [2022-07-22 16:08:09,547 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 16:08:09,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-22 16:08:09,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e4b8f45/d76492e2c44f422d99b5f24d79578ce2/FLAGa8b7b951b [2022-07-22 16:08:09,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e4b8f45/d76492e2c44f422d99b5f24d79578ce2 [2022-07-22 16:08:09,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 16:08:09,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 16:08:09,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 16:08:09,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 16:08:09,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 16:08:09,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:08:09" (1/1) ... [2022-07-22 16:08:09,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195577fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:09, skipping insertion in model container [2022-07-22 16:08:09,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:08:09" (1/1) ... [2022-07-22 16:08:09,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 16:08:10,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 16:08:10,194 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-22 16:08:10,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:08:10,216 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 16:08:10,228 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-22 16:08:10,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:08:10,248 INFO L208 MainTranslator]: Completed translation [2022-07-22 16:08:10,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10 WrapperNode [2022-07-22 16:08:10,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 16:08:10,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 16:08:10,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 16:08:10,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 16:08:10,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,275 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-07-22 16:08:10,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 16:08:10,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 16:08:10,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 16:08:10,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 16:08:10,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 16:08:10,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 16:08:10,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 16:08:10,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 16:08:10,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (1/1) ... [2022-07-22 16:08:10,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:08:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:08:10,336 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-07-22 16:08:10,346 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-07-22 16:08:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 16:08:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 16:08:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 16:08:10,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 16:08:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 16:08:10,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 16:08:10,415 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 16:08:10,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 16:08:10,485 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 16:08:10,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 16:08:10,490 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 16:08:10,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:08:10 BoogieIcfgContainer [2022-07-22 16:08:10,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 16:08:10,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 16:08:10,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 16:08:10,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 16:08:10,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 04:08:09" (1/3) ... [2022-07-22 16:08:10,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1f829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:08:10, skipping insertion in model container [2022-07-22 16:08:10,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:10" (2/3) ... [2022-07-22 16:08:10,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1f829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:08:10, skipping insertion in model container [2022-07-22 16:08:10,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:08:10" (3/3) ... [2022-07-22 16:08:10,498 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound10.c [2022-07-22 16:08:10,510 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 16:08:10,511 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 16:08:10,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 16:08:10,554 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70e4b9e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@685064b7 [2022-07-22 16:08:10,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 16:08:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:08:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-22 16:08:10,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:08:10,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:08:10,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:08:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:08:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-22 16:08:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:08:10,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169753754] [2022-07-22 16:08:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:08:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:08:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:08:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:08:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:08:10,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169753754] [2022-07-22 16:08:10,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169753754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:08:10,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:08:10,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 16:08:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236216822] [2022-07-22 16:08:10,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:08:10,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 16:08:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:08:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 16:08:10,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 16:08:10,740 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:08:10,756 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-22 16:08:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 16:08:10,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-22 16:08:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:08:10,766 INFO L225 Difference]: With dead ends: 32 [2022-07-22 16:08:10,766 INFO L226 Difference]: Without dead ends: 13 [2022-07-22 16:08:10,769 INFO L412 NwaCegarLoop]: 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-07-22 16:08:10,772 INFO L413 NwaCegarLoop]: 19 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, 19 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-07-22 16:08:10,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 16:08:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-22 16:08:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-22 16:08:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 16:08:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-22 16:08:10,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-22 16:08:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:08:10,803 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-22 16:08:10,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-22 16:08:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 16:08:10,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:08:10,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:08:10,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 16:08:10,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:08:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:08:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-22 16:08:10,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:08:10,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284704051] [2022-07-22 16:08:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:08:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:08:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:08:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:08:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:08:10,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284704051] [2022-07-22 16:08:10,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284704051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:08:10,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:08:10,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 16:08:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406849694] [2022-07-22 16:08:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:08:10,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 16:08:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:08:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 16:08:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 16:08:10,931 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:08:10,943 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-22 16:08:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 16:08:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-22 16:08:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:08:10,944 INFO L225 Difference]: With dead ends: 22 [2022-07-22 16:08:10,944 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 16:08:10,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 16:08:10,958 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 16:08:10,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 16:08:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 16:08:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 16:08:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 16:08:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-22 16:08:10,963 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-22 16:08:10,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:08:10,963 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-22 16:08:10,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-22 16:08:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 16:08:10,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:08:10,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:08:10,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 16:08:10,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:08:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:08:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-22 16:08:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:08:10,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208947421] [2022-07-22 16:08:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:08:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:08:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 16:08:10,974 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 16:08:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 16:08:10,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 16:08:10,994 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 16:08:10,994 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 16:08:10,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 16:08:10,998 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-22 16:08:11,001 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 16:08:11,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 04:08:11 BoogieIcfgContainer [2022-07-22 16:08:11,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 16:08:11,029 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 16:08:11,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 16:08:11,030 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 16:08:11,030 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:08:10" (3/4) ... [2022-07-22 16:08:11,032 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 16:08:11,033 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 16:08:11,034 INFO L158 Benchmark]: Toolchain (without parser) took 1055.29ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 66.9MB in the beginning and 85.9MB in the end (delta: -19.0MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2022-07-22 16:08:11,034 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:08:11,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.38ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 66.6MB in the beginning and 92.4MB in the end (delta: -25.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 16:08:11,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.59ms. Allocated memory is still 115.3MB. Free memory was 92.0MB in the beginning and 90.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 16:08:11,036 INFO L158 Benchmark]: Boogie Preprocessor took 14.70ms. Allocated memory is still 115.3MB. Free memory was 90.8MB in the beginning and 89.9MB in the end (delta: 834.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:08:11,036 INFO L158 Benchmark]: RCFGBuilder took 199.83ms. Allocated memory is still 115.3MB. Free memory was 89.5MB in the beginning and 81.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 16:08:11,037 INFO L158 Benchmark]: TraceAbstraction took 535.51ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 85.9MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:08:11,037 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 115.3MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:08:11,043 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.38ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 66.6MB in the beginning and 92.4MB in the end (delta: -25.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.59ms. Allocated memory is still 115.3MB. Free memory was 92.0MB in the beginning and 90.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.70ms. Allocated memory is still 115.3MB. Free memory was 90.8MB in the beginning and 89.9MB in the end (delta: 834.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 199.83ms. Allocated memory is still 115.3MB. Free memory was 89.5MB in the beginning and 81.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 535.51ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 85.9MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 115.3MB. Free memory is still 85.9MB. 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [counter=0, r=0] [L32] EXPR counter++ VAL [counter=1, counter++=0, r=0] [L32] COND TRUE counter++<10 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 16:08:11,085 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 -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/nla-digbench-scaling/freire1_unwindbound10.c -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 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 16:08:12,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 16:08:12,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 16:08:13,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 16:08:13,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 16:08:13,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 16:08:13,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 16:08:13,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 16:08:13,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 16:08:13,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 16:08:13,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 16:08:13,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 16:08:13,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 16:08:13,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 16:08:13,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 16:08:13,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 16:08:13,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 16:08:13,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 16:08:13,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 16:08:13,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 16:08:13,047 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 16:08:13,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 16:08:13,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 16:08:13,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 16:08:13,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 16:08:13,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 16:08:13,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 16:08:13,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 16:08:13,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 16:08:13,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 16:08:13,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 16:08:13,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 16:08:13,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 16:08:13,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 16:08:13,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 16:08:13,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 16:08:13,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 16:08:13,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 16:08:13,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 16:08:13,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 16:08:13,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 16:08:13,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 16:08:13,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 16:08:13,101 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 16:08:13,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 16:08:13,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 16:08:13,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 16:08:13,102 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 16:08:13,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 16:08:13,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 16:08:13,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 16:08:13,104 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 16:08:13,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 16:08:13,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 16:08:13,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 16:08:13,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 16:08:13,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 16:08:13,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 16:08:13,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 16:08:13,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 16:08:13,115 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 16:08:13,115 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 16:08:13,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 16:08:13,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 16:08:13,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 16:08:13,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 16:08:13,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 16:08:13,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 16:08:13,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 16:08:13,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:08:13,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 16:08:13,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 16:08:13,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 16:08:13,118 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 16:08:13,118 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 16:08:13,118 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 16:08:13,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 16:08:13,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 16:08:13,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 16:08:13,119 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 -> 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 [2022-07-22 16:08:13,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 16:08:13,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 16:08:13,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 16:08:13,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 16:08:13,447 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 16:08:13,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-22 16:08:13,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39cec1e3/78162e9666c14c7b88538a520839afaa/FLAG07a16de39 [2022-07-22 16:08:13,904 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 16:08:13,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-22 16:08:13,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39cec1e3/78162e9666c14c7b88538a520839afaa/FLAG07a16de39 [2022-07-22 16:08:14,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39cec1e3/78162e9666c14c7b88538a520839afaa [2022-07-22 16:08:14,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 16:08:14,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 16:08:14,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 16:08:14,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 16:08:14,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 16:08:14,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644a387e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14, skipping insertion in model container [2022-07-22 16:08:14,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 16:08:14,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 16:08:14,476 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-22 16:08:14,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:08:14,510 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 16:08:14,560 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-22 16:08:14,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:08:14,588 INFO L208 MainTranslator]: Completed translation [2022-07-22 16:08:14,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14 WrapperNode [2022-07-22 16:08:14,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 16:08:14,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 16:08:14,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 16:08:14,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 16:08:14,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,627 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2022-07-22 16:08:14,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 16:08:14,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 16:08:14,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 16:08:14,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 16:08:14,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 16:08:14,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 16:08:14,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 16:08:14,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 16:08:14,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (1/1) ... [2022-07-22 16:08:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:08:14,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:08:14,704 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-07-22 16:08:14,729 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-07-22 16:08:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 16:08:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 16:08:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 16:08:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 16:08:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 16:08:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 16:08:14,807 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 16:08:14,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 16:08:15,540 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 16:08:15,545 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 16:08:15,545 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 16:08:15,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:08:15 BoogieIcfgContainer [2022-07-22 16:08:15,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 16:08:15,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 16:08:15,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 16:08:15,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 16:08:15,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 04:08:14" (1/3) ... [2022-07-22 16:08:15,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd74767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:08:15, skipping insertion in model container [2022-07-22 16:08:15,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:08:14" (2/3) ... [2022-07-22 16:08:15,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd74767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:08:15, skipping insertion in model container [2022-07-22 16:08:15,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:08:15" (3/3) ... [2022-07-22 16:08:15,554 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound10.c [2022-07-22 16:08:15,575 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 16:08:15,575 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 16:08:15,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 16:08:15,632 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f4d57b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b0f7c77 [2022-07-22 16:08:15,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 16:08:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:08:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-22 16:08:15,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:08:15,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:08:15,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:08:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:08:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-22 16:08:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:08:15,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200299678] [2022-07-22 16:08:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:08:15,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:08:15,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:08:15,671 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-07-22 16:08:15,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 16:08:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:08:16,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 16:08:16,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:08:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:08:16,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 16:08:16,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:08:16,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200299678] [2022-07-22 16:08:16,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200299678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:08:16,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:08:16,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 16:08:16,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637623083] [2022-07-22 16:08:16,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:08:16,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 16:08:16,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:08:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 16:08:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 16:08:16,088 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:08:16,104 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-22 16:08:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 16:08:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-22 16:08:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:08:16,113 INFO L225 Difference]: With dead ends: 32 [2022-07-22 16:08:16,113 INFO L226 Difference]: Without dead ends: 13 [2022-07-22 16:08:16,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-07-22 16:08:16,120 INFO L413 NwaCegarLoop]: 19 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, 19 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-07-22 16:08:16,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 16:08:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-22 16:08:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-22 16:08:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 16:08:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-22 16:08:16,151 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-22 16:08:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:08:16,151 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-22 16:08:16,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-22 16:08:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 16:08:16,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:08:16,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:08:16,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 16:08:16,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:08:16,368 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:08:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:08:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-22 16:08:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:08:16,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135362274] [2022-07-22 16:08:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:08:16,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:08:16,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:08:16,372 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-07-22 16:08:16,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 16:08:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:08:16,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 16:08:16,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:08:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:08:16,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 16:08:16,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:08:16,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135362274] [2022-07-22 16:08:16,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135362274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:08:16,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:08:16,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 16:08:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074388388] [2022-07-22 16:08:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:08:16,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 16:08:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:08:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 16:08:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 16:08:16,708 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:08:17,459 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-22 16:08:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 16:08:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-22 16:08:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:08:17,461 INFO L225 Difference]: With dead ends: 22 [2022-07-22 16:08:17,461 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 16:08:17,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 16:08:17,462 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 16:08:17,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 16:08:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 16:08:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 16:08:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 16:08:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-22 16:08:17,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-22 16:08:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:08:17,467 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-22 16:08:17,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:08:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-22 16:08:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 16:08:17,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:08:17,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:08:17,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 16:08:17,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:08:17,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:08:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:08:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-22 16:08:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:08:17,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844457838] [2022-07-22 16:08:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:08:17,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:08:17,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:08:17,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:08:17,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 16:08:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:08:19,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 16:08:19,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:08:40,502 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-22 16:08:47,542 WARN L833 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) c___VERIFIER_assert_~cond) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= (_ bv0 32) c___VERIFIER_assert_~cond))) is different from false [2022-07-22 16:08:57,493 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from true [2022-07-22 16:08:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:08:57,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 16:08:57,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:08:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844457838] [2022-07-22 16:08:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844457838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:08:57,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:08:57,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 16:08:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025675166] [2022-07-22 16:08:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:08:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 16:08:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:08:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 16:08:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=9, Unknown=3, NotChecked=18, Total=42 [2022-07-22 16:08:57,496 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:09:00,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:09:02,626 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 16:09:05,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:09:07,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:09:09,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:09:11,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:09:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:09:11,909 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-07-22 16:09:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 16:09:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-22 16:09:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:09:11,919 INFO L225 Difference]: With dead ends: 28 [2022-07-22 16:09:11,919 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 16:09:11,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14, Invalid=10, Unknown=4, NotChecked=28, Total=56 [2022-07-22 16:09:11,921 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-22 16:09:11,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 5 Unknown, 47 Unchecked, 12.2s Time] [2022-07-22 16:09:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 16:09:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-22 16:09:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:09:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 16:09:11,927 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2022-07-22 16:09:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:09:11,927 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 16:09:11,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:09:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 16:09:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 16:09:11,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:09:11,929 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:09:11,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 16:09:12,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:09:12,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:09:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:09:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2022-07-22 16:09:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:09:12,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683710576] [2022-07-22 16:09:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:09:12,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:09:12,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:09:12,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:09:12,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 16:09:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:09:12,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 16:09:12,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:09:18,709 WARN L833 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-07-22 16:09:20,771 WARN L855 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-07-22 16:09:33,170 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-07-22 16:09:41,463 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-07-22 16:09:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 16:09:41,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:10:06,362 WARN L233 SmtUtils]: Spent 16.47s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 16:10:22,840 WARN L233 SmtUtils]: Spent 16.48s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 16:10:29,078 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-22 16:10:39,484 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-22 16:10:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 16:10:39,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:10:39,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683710576] [2022-07-22 16:10:39,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683710576] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:10:39,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:10:39,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-22 16:10:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132592213] [2022-07-22 16:10:39,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:10:39,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 16:10:39,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:10:39,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 16:10:39,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2022-07-22 16:10:39,490 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 16:10:41,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:10:43,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:10:45,789 WARN L855 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2022-07-22 16:10:47,875 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2022-07-22 16:10:49,946 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-22 16:10:52,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from false [2022-07-22 16:10:54,088 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from true [2022-07-22 16:10:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:10:54,091 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-22 16:10:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 16:10:54,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-07-22 16:10:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:10:54,092 INFO L225 Difference]: With dead ends: 27 [2022-07-22 16:10:54,092 INFO L226 Difference]: Without dead ends: 19 [2022-07-22 16:10:54,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2022-07-22 16:10:54,093 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 16:10:54,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 40 Unchecked, 4.2s Time] [2022-07-22 16:10:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-22 16:10:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-22 16:10:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:10:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-22 16:10:54,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-07-22 16:10:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:10:54,102 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-22 16:10:54,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 16:10:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-22 16:10:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 16:10:54,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:10:54,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:10:54,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 16:10:54,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:10:54,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:10:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:10:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-07-22 16:10:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:10:54,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434239473] [2022-07-22 16:10:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:10:54,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:10:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:10:54,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:10:54,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 16:10:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:10:54,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 16:10:54,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:10:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:10:55,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:10:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:10:55,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:10:55,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434239473] [2022-07-22 16:10:55,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434239473] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:10:55,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:10:55,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-22 16:10:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411701179] [2022-07-22 16:10:55,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:10:55,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 16:10:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:10:55,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 16:10:55,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-22 16:10:55,390 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:10:58,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:00,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:03,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:05,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:07,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:09,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:11,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:13,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:15,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:17,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:19,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:21,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:11:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:11:21,936 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-07-22 16:11:21,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 16:11:21,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-22 16:11:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:11:21,937 INFO L225 Difference]: With dead ends: 50 [2022-07-22 16:11:21,938 INFO L226 Difference]: Without dead ends: 43 [2022-07-22 16:11:21,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-22 16:11:21,939 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2022-07-22 16:11:21,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 12 Unknown, 0 Unchecked, 26.3s Time] [2022-07-22 16:11:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-22 16:11:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-22 16:11:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 16:11:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-22 16:11:21,946 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2022-07-22 16:11:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:11:21,946 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-22 16:11:21,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:11:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-07-22 16:11:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 16:11:21,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:11:21,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:11:21,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-22 16:11:22,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:11:22,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:11:22,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:11:22,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2022-07-22 16:11:22,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:11:22,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361869264] [2022-07-22 16:11:22,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:11:22,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:11:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:11:22,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:11:22,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 16:11:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 16:11:27,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 16:11:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 16:11:35,196 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-22 16:11:35,196 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 16:11:35,197 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 16:11:35,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 16:11:35,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:11:35,402 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-22 16:11:35,405 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 16:11:35,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 04:11:35 BoogieIcfgContainer [2022-07-22 16:11:35,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 16:11:35,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 16:11:35,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 16:11:35,426 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 16:11:35,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:08:15" (3/4) ... [2022-07-22 16:11:35,427 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 16:11:35,470 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 16:11:35,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 16:11:35,473 INFO L158 Benchmark]: Toolchain (without parser) took 201137.65ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.3MB in the beginning and 37.0MB in the end (delta: -1.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-22 16:11:35,474 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:35,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.85ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 39.6MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 16:11:35,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.00ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 38.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:35,475 INFO L158 Benchmark]: Boogie Preprocessor took 44.23ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 36.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:35,475 INFO L158 Benchmark]: RCFGBuilder took 873.09ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 28.0MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 16:11:35,476 INFO L158 Benchmark]: TraceAbstraction took 199876.57ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.6MB in the beginning and 38.8MB in the end (delta: -11.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2022-07-22 16:11:35,477 INFO L158 Benchmark]: Witness Printer took 47.53ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 37.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 16:11:35,479 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.85ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 39.6MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.00ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 38.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.23ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 36.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 873.09ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 28.0MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 199876.57ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.6MB in the beginning and 38.8MB in the end (delta: -11.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 47.53ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 37.0MB in the end (delta: 1.8MB). 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [a=16039263319621250, counter=0, r=0, x=8019631659810625] [L32] EXPR counter++ VAL [a=16039263319621250, counter=1, counter++=0, r=0, x=8019631659810625] [L32] COND TRUE counter++<10 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=1, counter=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L33] RET __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [a=16039263319621250, counter=1, r=0, x=8019631659810625] [L35] COND FALSE !(!(x > r)) [L37] x = x - r [L38] r = r + 1 VAL [a=16039263319621250, counter=1, r=1, x=8019631659810625] [L32] EXPR counter++ VAL [a=16039263319621250, counter=2, counter++=1, r=1, x=8019631659810625] [L32] COND TRUE counter++<10 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=2] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 199.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 56.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 43.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 42.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 87 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 70 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 35.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 30, 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, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 125.4s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 8 QuantifiedInterpolants, 576 SizeOfPredicates, 7 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6/12 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-07-22 16:11:35,693 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