./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.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/float-benchs/filter1.c.p+cfa-reducer.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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:46:31,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:46:31,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:46:31,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:46:31,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:46:31,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:46:31,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:46:31,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:46:31,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:46:31,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:46:31,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:46:31,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:46:31,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:46:31,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:46:31,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:46:31,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:46:31,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:46:31,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:46:31,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:46:31,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:46:31,356 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:46:31,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:46:31,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:46:31,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:46:31,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:46:31,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:46:31,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:46:31,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:46:31,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:46:31,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:46:31,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:46:31,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:46:31,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:46:31,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:46:31,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:46:31,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:46:31,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:46:31,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:46:31,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:46:31,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:46:31,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:46:31,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:46:31,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 13:46:31,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:46:31,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:46:31,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:46:31,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:46:31,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:46:31,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:46:31,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:46:31,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:46:31,412 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:46:31,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:46:31,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:46:31,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 13:46:31,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:46:31,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:46:31,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:46:31,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:46:31,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:46:31,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:46:31,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:46:31,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:46:31,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:46:31,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:46:31,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:46:31,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:46:31,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:46:31,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:46:31,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:46:31,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:46:31,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 13:46:31,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 13:46:31,417 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:46:31,417 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:46:31,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:46:31,417 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2022-07-22 13:46:31,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:46:31,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:46:31,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:46:31,665 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:46:31,665 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:46:31,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-07-22 13:46:31,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fefb4930/07068961590c4005b7107abba83fd004/FLAGcc8811cbc [2022-07-22 13:46:32,092 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:46:32,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-07-22 13:46:32,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fefb4930/07068961590c4005b7107abba83fd004/FLAGcc8811cbc [2022-07-22 13:46:32,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fefb4930/07068961590c4005b7107abba83fd004 [2022-07-22 13:46:32,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:46:32,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:46:32,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:46:32,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:46:32,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:46:32,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3a301a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32, skipping insertion in model container [2022-07-22 13:46:32,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:46:32,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:46:32,345 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/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-07-22 13:46:32,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:46:32,363 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:46:32,374 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/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-07-22 13:46:32,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:46:32,386 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:46:32,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32 WrapperNode [2022-07-22 13:46:32,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:46:32,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:46:32,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:46:32,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:46:32,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,412 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-07-22 13:46:32,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:46:32,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:46:32,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:46:32,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:46:32,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:46:32,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:46:32,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:46:32,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:46:32,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (1/1) ... [2022-07-22 13:46:32,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:46:32,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:46:32,454 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 13:46:32,456 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 13:46:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:46:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 13:46:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:46:32,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:46:32,549 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:46:32,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:46:32,639 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:46:32,644 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:46:32,645 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 13:46:32,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:46:32 BoogieIcfgContainer [2022-07-22 13:46:32,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:46:32,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:46:32,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:46:32,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:46:32,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:46:32" (1/3) ... [2022-07-22 13:46:32,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568889d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:46:32, skipping insertion in model container [2022-07-22 13:46:32,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:32" (2/3) ... [2022-07-22 13:46:32,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568889d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:46:32, skipping insertion in model container [2022-07-22 13:46:32,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:46:32" (3/3) ... [2022-07-22 13:46:32,653 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-07-22 13:46:32,665 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:46:32,665 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:46:32,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:46:32,708 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@c05a5dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18b73d9f [2022-07-22 13:46:32,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:46:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:46:32,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:32,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:32,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2022-07-22 13:46:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:46:32,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205884075] [2022-07-22 13:46:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:32,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:46:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:32,847 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 13:46:32,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:46:32,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205884075] [2022-07-22 13:46:32,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205884075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:46:32,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:46:32,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:46:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876842850] [2022-07-22 13:46:32,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:46:32,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:46:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:46:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:46:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:46:32,889 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:46:32,924 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-07-22 13:46:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:46:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:46:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:46:32,931 INFO L225 Difference]: With dead ends: 40 [2022-07-22 13:46:32,931 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 13:46:32,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:46:32,937 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:46:32,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:46:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 13:46:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 13:46:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-22 13:46:32,963 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2022-07-22 13:46:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:46:32,963 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-22 13:46:32,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-07-22 13:46:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:46:32,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:32,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:32,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 13:46:32,965 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2022-07-22 13:46:32,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:46:32,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285447406] [2022-07-22 13:46:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:46:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:33,043 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 13:46:33,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:46:33,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285447406] [2022-07-22 13:46:33,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285447406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:46:33,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:46:33,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 13:46:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408241293] [2022-07-22 13:46:33,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:46:33,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 13:46:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:46:33,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 13:46:33,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 13:46:33,047 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:46:33,112 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-07-22 13:46:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 13:46:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:46:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:46:33,113 INFO L225 Difference]: With dead ends: 36 [2022-07-22 13:46:33,113 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 13:46:33,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 13:46:33,115 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:46:33,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:46:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 13:46:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2022-07-22 13:46:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-22 13:46:33,122 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-07-22 13:46:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:46:33,122 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 13:46:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-22 13:46:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:46:33,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:33,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:33,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 13:46:33,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2022-07-22 13:46:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:46:33,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061259137] [2022-07-22 13:46:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:46:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:46:33,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 13:46:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:46:33,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 13:46:33,169 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 13:46:33,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 13:46:33,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 13:46:33,174 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-22 13:46:33,177 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 13:46:33,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:46:33 BoogieIcfgContainer [2022-07-22 13:46:33,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 13:46:33,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 13:46:33,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 13:46:33,209 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 13:46:33,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:46:32" (3/4) ... [2022-07-22 13:46:33,212 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 13:46:33,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 13:46:33,213 INFO L158 Benchmark]: Toolchain (without parser) took 1094.50ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 74.8MB in the beginning and 95.2MB in the end (delta: -20.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-07-22 13:46:33,214 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 107.0MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:46:33,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.65ms. Allocated memory is still 107.0MB. Free memory was 74.6MB in the beginning and 81.1MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 13:46:33,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.39ms. Allocated memory is still 107.0MB. Free memory was 80.8MB in the beginning and 79.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:46:33,221 INFO L158 Benchmark]: Boogie Preprocessor took 14.68ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 78.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 13:46:33,223 INFO L158 Benchmark]: RCFGBuilder took 217.91ms. Allocated memory is still 107.0MB. Free memory was 78.4MB in the beginning and 69.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 13:46:33,224 INFO L158 Benchmark]: TraceAbstraction took 560.27ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 69.0MB in the beginning and 95.9MB in the end (delta: -26.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 13:46:33,225 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 136.3MB. Free memory was 95.9MB in the beginning and 95.2MB in the end (delta: 703.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 13:46:33,228 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.10ms. Allocated memory is still 107.0MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.65ms. Allocated memory is still 107.0MB. Free memory was 74.6MB in the beginning and 81.1MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.39ms. Allocated memory is still 107.0MB. Free memory was 80.8MB in the beginning and 79.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.68ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 78.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 217.91ms. Allocated memory is still 107.0MB. Free memory was 78.4MB in the beginning and 69.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 560.27ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 69.0MB in the beginning and 95.9MB in the end (delta: -26.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 136.3MB. Free memory was 95.9MB in the beginning and 95.2MB in the end (delta: 703.2kB). 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 - UnprovableResult [Line: 56]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of to_real at line 39. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__E0=49, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__E0=49, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__i=0] [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L56] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 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, 46 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 52 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 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 13:46:33,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- 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/float-benchs/filter1.c.p+cfa-reducer.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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:46:35,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:46:35,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:46:35,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:46:35,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:46:35,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:46:35,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:46:35,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:46:35,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:46:35,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:46:35,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:46:35,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:46:35,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:46:35,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:46:35,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:46:35,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:46:35,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:46:35,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:46:35,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:46:35,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:46:35,219 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:46:35,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:46:35,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:46:35,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:46:35,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:46:35,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:46:35,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:46:35,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:46:35,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:46:35,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:46:35,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:46:35,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:46:35,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:46:35,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:46:35,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:46:35,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:46:35,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:46:35,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:46:35,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:46:35,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:46:35,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:46:35,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:46:35,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 13:46:35,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:46:35,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:46:35,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:46:35,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:46:35,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:46:35,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:46:35,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:46:35,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:46:35,288 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:46:35,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:46:35,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:46:35,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:46:35,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:46:35,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:46:35,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:46:35,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:46:35,290 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 13:46:35,290 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 13:46:35,290 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 13:46:35,290 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:46:35,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:46:35,291 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:46:35,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:46:35,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:46:35,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:46:35,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:46:35,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:46:35,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:46:35,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:46:35,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:46:35,292 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 13:46:35,293 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 13:46:35,293 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:46:35,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:46:35,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:46:35,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 13:46:35,294 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2022-07-22 13:46:35,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:46:35,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:46:35,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:46:35,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:46:35,606 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:46:35,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-07-22 13:46:35,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549e478a7/246c589658e7472a91633ea7e27ff555/FLAG4c0457655 [2022-07-22 13:46:36,135 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:46:36,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-07-22 13:46:36,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549e478a7/246c589658e7472a91633ea7e27ff555/FLAG4c0457655 [2022-07-22 13:46:36,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549e478a7/246c589658e7472a91633ea7e27ff555 [2022-07-22 13:46:36,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:46:36,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:46:36,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:46:36,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:46:36,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:46:36,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276d9b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36, skipping insertion in model container [2022-07-22 13:46:36,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:46:36,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:46:36,779 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/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-07-22 13:46:36,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:46:36,825 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:46:36,838 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/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-07-22 13:46:36,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:46:36,851 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:46:36,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36 WrapperNode [2022-07-22 13:46:36,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:46:36,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:46:36,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:46:36,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:46:36,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,876 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-07-22 13:46:36,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:46:36,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:46:36,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:46:36,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:46:36,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:46:36,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:46:36,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:46:36,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:46:36,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (1/1) ... [2022-07-22 13:46:36,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:46:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:46:36,957 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 13:46:36,975 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 13:46:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:46:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 13:46:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:46:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:46:37,054 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:46:37,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:46:39,213 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:46:39,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:46:39,219 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 13:46:39,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:46:39 BoogieIcfgContainer [2022-07-22 13:46:39,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:46:39,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:46:39,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:46:39,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:46:39,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:46:36" (1/3) ... [2022-07-22 13:46:39,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a95fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:46:39, skipping insertion in model container [2022-07-22 13:46:39,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:46:36" (2/3) ... [2022-07-22 13:46:39,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a95fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:46:39, skipping insertion in model container [2022-07-22 13:46:39,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:46:39" (3/3) ... [2022-07-22 13:46:39,250 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-07-22 13:46:39,261 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:46:39,267 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:46:39,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:46:39,318 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@5e7df250, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c9b5c9d [2022-07-22 13:46:39,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:46:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:46:39,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:39,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:39,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2022-07-22 13:46:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:46:39,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674324112] [2022-07-22 13:46:39,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:39,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:46:39,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:46:39,355 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 13:46:39,378 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 13:46:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:39,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 13:46:39,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:46:39,491 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 13:46:39,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:46:39,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:46:39,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674324112] [2022-07-22 13:46:39,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674324112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:46:39,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:46:39,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:46:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412821415] [2022-07-22 13:46:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:46:39,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:46:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:46:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:46:39,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:46:39,534 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:46:39,784 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-07-22 13:46:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:46:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:46:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:46:39,794 INFO L225 Difference]: With dead ends: 40 [2022-07-22 13:46:39,794 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 13:46:39,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:46:39,807 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 13:46:39,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 13:46:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 13:46:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 13:46:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-22 13:46:39,838 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2022-07-22 13:46:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:46:39,838 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-22 13:46:39,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-07-22 13:46:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:46:39,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:39,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:39,856 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 13:46:40,056 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 13:46:40,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2022-07-22 13:46:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:46:40,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680772026] [2022-07-22 13:46:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:40,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:46:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:46:40,060 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 13:46:40,062 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 13:46:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:40,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 13:46:40,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:46:40,182 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 13:46:40,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:46:40,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:46:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680772026] [2022-07-22 13:46:40,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680772026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:46:40,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:46:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 13:46:40,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918042044] [2022-07-22 13:46:40,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:46:40,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 13:46:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:46:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 13:46:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 13:46:40,204 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:46:40,311 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-07-22 13:46:40,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 13:46:40,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:46:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:46:40,313 INFO L225 Difference]: With dead ends: 30 [2022-07-22 13:46:40,313 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 13:46:40,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 13:46:40,314 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 13:46:40,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 13:46:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 13:46:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2022-07-22 13:46:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-22 13:46:40,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-07-22 13:46:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:46:40,329 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 13:46:40,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-22 13:46:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:46:40,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:40,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:40,345 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 13:46:40,539 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 13:46:40,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2022-07-22 13:46:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:46:40,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021980422] [2022-07-22 13:46:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:40,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:46:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:46:40,544 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 13:46:40,545 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 13:46:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:40,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 13:46:40,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:46:40,616 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 13:46:40,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:46:40,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:46:40,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021980422] [2022-07-22 13:46:40,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021980422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:46:40,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:46:40,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:46:40,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624039530] [2022-07-22 13:46:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:46:40,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:46:40,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:46:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:46:40,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:46:40,620 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:46:41,178 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-07-22 13:46:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:46:41,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:46:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:46:41,180 INFO L225 Difference]: With dead ends: 42 [2022-07-22 13:46:41,180 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 13:46:41,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:46:41,181 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 13:46:41,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 13:46:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 13:46:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-07-22 13:46:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-22 13:46:41,186 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2022-07-22 13:46:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:46:41,186 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-22 13:46:41,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-22 13:46:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:46:41,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:41,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:41,198 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 13:46:41,397 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 13:46:41,398 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2022-07-22 13:46:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:46:41,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878657115] [2022-07-22 13:46:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:41,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:46:41,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:46:41,401 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 13:46:41,403 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 13:46:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:41,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 13:46:41,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:46:42,268 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 13:46:42,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:46:42,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:46:42,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878657115] [2022-07-22 13:46:42,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878657115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:46:42,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:46:42,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 13:46:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989423364] [2022-07-22 13:46:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:46:42,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 13:46:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:46:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 13:46:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 13:46:42,270 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:44,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:46:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:46:44,868 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-22 13:46:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 13:46:44,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:46:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:46:44,870 INFO L225 Difference]: With dead ends: 47 [2022-07-22 13:46:44,870 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 13:46:44,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 13:46:44,871 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-22 13:46:44,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 1 Unknown, 10 Unchecked, 2.6s Time] [2022-07-22 13:46:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 13:46:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-22 13:46:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-22 13:46:44,876 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2022-07-22 13:46:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:46:44,876 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-22 13:46:44,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-22 13:46:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 13:46:44,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:44,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:44,895 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 13:46:45,088 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 13:46:45,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1249715145, now seen corresponding path program 1 times [2022-07-22 13:46:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:46:45,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712438118] [2022-07-22 13:46:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:45,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:46:45,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:46:45,091 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 13:46:45,093 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 13:46:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:45,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 13:46:45,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:46:46,006 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 13:46:46,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:46:46,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:46:46,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712438118] [2022-07-22 13:46:46,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712438118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:46:46,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:46:46,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 13:46:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923327848] [2022-07-22 13:46:46,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:46:46,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 13:46:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:46:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 13:46:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 13:46:46,009 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:48,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:46:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:46:48,625 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-22 13:46:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 13:46:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 13:46:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:46:48,627 INFO L225 Difference]: With dead ends: 49 [2022-07-22 13:46:48,627 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 13:46:48,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 13:46:48,628 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-22 13:46:48,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 1 Unknown, 4 Unchecked, 2.6s Time] [2022-07-22 13:46:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 13:46:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-07-22 13:46:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-22 13:46:48,633 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-07-22 13:46:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:46:48,633 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 13:46:48,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:46:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-22 13:46:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 13:46:48,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:46:48,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:46:48,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 13:46:48,851 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 13:46:48,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:46:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:46:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2022-07-22 13:46:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:46:48,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425830965] [2022-07-22 13:46:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:46:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:46:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:46:48,854 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 13:46:48,855 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 13:46:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:46:49,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 13:46:49,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:47:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:47:03,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:47:11,430 WARN L833 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2022-07-22 13:47:13,480 WARN L855 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2022-07-22 13:47:27,884 WARN L833 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-07-22 13:47:29,938 WARN L855 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-07-22 13:47:44,440 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2022-07-22 13:49:01,065 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) is different from true [2022-07-22 13:49:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-22 13:49:09,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:49:09,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425830965] [2022-07-22 13:49:09,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425830965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 13:49:09,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 13:49:09,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2022-07-22 13:49:09,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430825897] [2022-07-22 13:49:09,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 13:49:09,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 13:49:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:49:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 13:49:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=84, Unknown=6, NotChecked=92, Total=240 [2022-07-22 13:49:09,060 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:49:11,532 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-22 13:49:13,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:49:19,506 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-22 13:49:21,630 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-22 13:49:23,797 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-22 13:49:25,935 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2022-07-22 13:49:28,002 WARN L855 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2022-07-22 13:49:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:49:28,004 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-07-22 13:49:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 13:49:28,004 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-22 13:49:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:49:28,005 INFO L225 Difference]: With dead ends: 67 [2022-07-22 13:49:28,005 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 13:49:28,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=78, Invalid=102, Unknown=12, NotChecked=270, Total=462 [2022-07-22 13:49:28,006 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-22 13:49:28,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 1 Unknown, 157 Unchecked, 2.6s Time] [2022-07-22 13:49:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 13:49:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2022-07-22 13:49:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:49:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-07-22 13:49:28,023 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2022-07-22 13:49:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:49:28,024 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-07-22 13:49:28,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:49:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-07-22 13:49:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 13:49:28,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:49:28,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:49:28,047 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 13:49:28,239 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 13:49:28,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:49:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:49:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash -530303885, now seen corresponding path program 1 times [2022-07-22 13:49:28,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:49:28,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864649888] [2022-07-22 13:49:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:49:28,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:49:28,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:49:28,242 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 13:49:28,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 13:49:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:49:31,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 13:49:31,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:49:50,902 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:50:34,596 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-07-22 13:50:36,628 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true