./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/inv_Newton.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 --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 f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:16:44,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:16:44,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 12:16:44,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:16:44,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:16:44,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:16:44,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:16:44,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:16:44,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:16:44,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:16:44,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:16:44,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:16:44,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:16:44,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:16:44,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:16:44,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:16:44,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:16:44,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:16:44,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:16:44,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:16:44,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:16:44,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:16:44,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:16:44,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:16:44,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:16:44,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:16:44,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:16:44,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:16:44,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:16:44,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:16:44,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:16:44,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:16:44,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:16:44,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:16:44,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:16:44,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:16:44,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:16:44,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:16:44,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:16:44,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:16:44,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:16:44,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:16:44,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-11-08 12:16:45,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:16:45,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:16:45,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:16:45,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:16:45,135 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:16:45,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-08 12:16:46,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:16:46,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:16:46,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-08 12:16:46,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c23c002c/d01e1e83bf234c2a9844f4d4086ffe01/FLAG30d06e05d [2024-11-08 12:16:47,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c23c002c/d01e1e83bf234c2a9844f4d4086ffe01 [2024-11-08 12:16:47,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:16:47,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:16:47,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:16:47,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:16:47,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:16:47,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab8958a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47, skipping insertion in model container [2024-11-08 12:16:47,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:16:47,448 WARN L250 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/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-08 12:16:47,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:16:47,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:16:47,502 WARN L250 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/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-08 12:16:47,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:16:47,526 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:16:47,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47 WrapperNode [2024-11-08 12:16:47,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:16:47,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:16:47,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:16:47,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:16:47,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,568 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 110 [2024-11-08 12:16:47,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:16:47,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:16:47,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:16:47,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:16:47,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,603 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-08 12:16:47,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:16:47,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:16:47,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:16:47,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:16:47,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (1/1) ... [2024-11-08 12:16:47,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:16:47,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:16:47,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:16:47,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:16:47,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:16:47,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:16:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 12:16:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 12:16:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 12:16:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 12:16:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 12:16:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:16:47,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:16:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 12:16:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 12:16:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 12:16:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:16:47,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:16:47,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:16:48,061 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-08 12:16:48,062 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:16:48,076 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:16:48,077 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:16:48,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:16:48 BoogieIcfgContainer [2024-11-08 12:16:48,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:16:48,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:16:48,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:16:48,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:16:48,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:16:47" (1/3) ... [2024-11-08 12:16:48,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2c0ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:16:48, skipping insertion in model container [2024-11-08 12:16:48,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:47" (2/3) ... [2024-11-08 12:16:48,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2c0ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:16:48, skipping insertion in model container [2024-11-08 12:16:48,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:16:48" (3/3) ... [2024-11-08 12:16:48,088 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-11-08 12:16:48,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:16:48,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:16:48,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:16:48,249 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22a7e990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:16:48,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:16:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:16:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 12:16:48,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:16:48,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:16:48,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:16:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:16:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash -9620842, now seen corresponding path program 1 times [2024-11-08 12:16:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:16:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792407477] [2024-11-08 12:16:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:16:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:16:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:16:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:16:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:16:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792407477] [2024-11-08 12:16:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792407477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:16:48,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:16:48,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:16:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46517925] [2024-11-08 12:16:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:16:48,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:16:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:16:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:16:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:16:48,667 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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) [2024-11-08 12:16:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:16:48,719 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-11-08 12:16:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:16:48,722 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 [2024-11-08 12:16:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:16:48,729 INFO L225 Difference]: With dead ends: 37 [2024-11-08 12:16:48,729 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 12:16:48,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:16:48,738 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:16:48,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:16:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 12:16:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-08 12:16:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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) [2024-11-08 12:16:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-08 12:16:48,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2024-11-08 12:16:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:16:48,774 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-08 12:16:48,774 INFO L472 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) [2024-11-08 12:16:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-08 12:16:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 12:16:48,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:16:48,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:16:48,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:16:48,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:16:48,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:16:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1149101563, now seen corresponding path program 1 times [2024-11-08 12:16:48,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:16:48,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76908183] [2024-11-08 12:16:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:16:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:16:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:16:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:16:48,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:16:48,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76908183] [2024-11-08 12:16:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76908183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:16:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:16:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:16:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760268862] [2024-11-08 12:16:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:16:48,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:16:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:16:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:16:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:16:48,907 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-08 12:16:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:16:48,934 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-11-08 12:16:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:16:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2024-11-08 12:16:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:16:48,936 INFO L225 Difference]: With dead ends: 33 [2024-11-08 12:16:48,937 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 12:16:48,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:16:48,940 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:16:48,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:16:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 12:16:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-08 12:16:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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) [2024-11-08 12:16:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-08 12:16:48,947 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 17 [2024-11-08 12:16:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:16:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-08 12:16:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-08 12:16:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-08 12:16:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 12:16:48,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:16:48,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:16:48,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:16:48,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:16:48,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:16:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1694700504, now seen corresponding path program 1 times [2024-11-08 12:16:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:16:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034344276] [2024-11-08 12:16:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:16:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:16:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:16:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:16:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:16:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034344276] [2024-11-08 12:16:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034344276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:16:49,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:16:49,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:16:49,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508571752] [2024-11-08 12:16:49,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:16:49,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:16:49,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:16:49,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:16:49,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:16:49,056 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-08 12:16:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:16:49,083 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-11-08 12:16:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:16:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2024-11-08 12:16:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:16:49,085 INFO L225 Difference]: With dead ends: 29 [2024-11-08 12:16:49,085 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 12:16:49,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:16:49,086 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:16:49,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:16:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 12:16:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-08 12:16:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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) [2024-11-08 12:16:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-08 12:16:49,098 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2024-11-08 12:16:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:16:49,099 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-08 12:16:49,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-08 12:16:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-08 12:16:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 12:16:49,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:16:49,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:16:49,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:16:49,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:16:49,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:16:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1711711165, now seen corresponding path program 1 times [2024-11-08 12:16:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:16:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544929322] [2024-11-08 12:16:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:16:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:16:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:16:49,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:16:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:16:49,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:16:49,167 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:16:49,168 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:16:49,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:16:49,173 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 12:16:49,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:16:49,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:16:49 BoogieIcfgContainer [2024-11-08 12:16:49,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:16:49,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:16:49,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:16:49,204 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:16:49,204 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:16:48" (3/4) ... [2024-11-08 12:16:49,207 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 12:16:49,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:16:49,209 INFO L158 Benchmark]: Toolchain (without parser) took 2004.59ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 102.9MB in the beginning and 138.9MB in the end (delta: -36.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-08 12:16:49,209 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:16:49,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.99ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 89.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 12:16:49,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.32ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 87.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:16:49,210 INFO L158 Benchmark]: Boogie Preprocessor took 58.24ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 85.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 12:16:49,210 INFO L158 Benchmark]: RCFGBuilder took 447.65ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 71.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 12:16:49,211 INFO L158 Benchmark]: TraceAbstraction took 1123.00ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 71.1MB in the beginning and 139.9MB in the end (delta: -68.8MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2024-11-08 12:16:49,211 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 226.5MB. Free memory was 139.9MB in the beginning and 138.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:16:49,213 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.99ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 89.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.32ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 87.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.24ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 85.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 447.65ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 71.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1123.00ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 71.1MB in the beginning and 139.9MB in the end (delta: -68.8MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 226.5MB. Free memory was 139.9MB in the beginning and 138.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 96]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of to_real at line 46, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53. Possible FailurePath: [L1] int __return_main; [L17] double __return_104; VAL [__return_104=0, __return_main=0] [L20] double main__a; [L21] double main__r; [L22] main__a = __VERIFIER_nondet_double() [L23] int main____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0] [L24] COND TRUE main__a >= 20.0 VAL [__return_104=0, __return_main=0] [L26] COND TRUE main__a <= 30.0 [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_104=0, __return_main=0, main____CPAchecker_TMP_0=1] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] double __tmp_1; [L34] __tmp_1 = main__a [L35] double inv__A; [L36] inv__A = __tmp_1 [L37] double inv__xi; [L38] double inv__xsi; [L39] double inv__temp; [L40] signed int inv__cond; [L41] signed int inv__exp; [L42] union double_int inv__A_u; [L43] union double_int inv__xi_u; [L44] inv__A_u.d = inv__A [L45] EXPR inv__A_u.i VAL [__return_104=0, __return_main=0] [L45] EXPR (inv__A_u.i) & 2146435072 VAL [__return_104=0, __return_main=0, inv__xi_u={5:0}] [L45] inv__exp = ((signed int)(((inv__A_u.i) & 2146435072) >> 20)) - 1023 [L46] inv__xi_u.d = 1 [L47] inv__xi_u.i = (1023 - inv__exp) << 20 [L48] EXPR inv__xi_u.d [L48] inv__xi = inv__xi_u.d [L49] inv__cond = 1 VAL [__return_104=0, __return_main=0, inv__cond=1, inv__xi=2145386510] [L51] COND TRUE !(inv__cond == 0) [L53] inv__xsi = (2 * inv__xi) - ((inv__A * inv__xi) * inv__xi) [L54] inv__temp = inv__xsi - inv__xi [L55] int inv____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0, inv__xi=2145386510] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, inv__xi=2145386510] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, inv____CPAchecker_TMP_0=0, inv__xi=2145386510] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, inv__cond=0, inv__xi=2145386512] [L51] COND FALSE !(!(inv__cond == 0)) [L80] __return_104 = inv__xi [L81] main__r = __return_104 [L82] int main____CPAchecker_TMP_1; VAL [__return_104=2145386512, __return_main=0] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2145386512, __return_main=0] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2145386512, __return_main=0, main____CPAchecker_TMP_1=0] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__VERIFIER_assert__cond=0, __return_104=2145386512, __return_main=0] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_104=2145386512, __return_main=0] [L96] reach_error() VAL [__return_104=2145386512, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 87 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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 [2024-11-08 12:16:49,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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: /root/.sdkman/candidates/java/11.0.12-open/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/inv_Newton.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 --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 f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:16:51,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:16:51,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 12:16:51,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:16:51,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:16:51,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:16:51,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:16:51,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:16:51,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:16:51,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:16:51,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:16:51,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:16:51,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:16:51,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:16:51,615 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:16:51,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:16:51,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:16:51,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:16:51,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:16:51,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:16:51,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:16:51,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:16:51,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:16:51,623 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:16:51,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:16:51,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:16:51,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:16:51,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:16:51,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:16:51,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:16:51,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:16:51,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:16:51,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:16:51,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:16:51,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:16:51,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:16:51,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:16:51,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:16:51,629 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 12:16:51,629 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:16:51,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:16:51,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:16:51,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:16:51,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:16:51,631 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-11-08 12:16:51,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:16:51,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:16:51,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:16:51,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:16:51,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:16:51,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-08 12:16:53,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:16:53,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:16:53,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-08 12:16:53,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b173e29/6b6d5d54d9bd486081a68758ca909a95/FLAGe6fbd2e1b [2024-11-08 12:16:53,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b173e29/6b6d5d54d9bd486081a68758ca909a95 [2024-11-08 12:16:53,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:16:53,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:16:53,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:16:53,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:16:53,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:16:53,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:16:53" (1/1) ... [2024-11-08 12:16:53,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1b946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:53, skipping insertion in model container [2024-11-08 12:16:53,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:16:53" (1/1) ... [2024-11-08 12:16:53,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:16:54,136 WARN L250 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/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-08 12:16:54,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:16:54,179 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:16:54,208 WARN L250 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/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-08 12:16:54,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:16:54,235 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:16:54,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54 WrapperNode [2024-11-08 12:16:54,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:16:54,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:16:54,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:16:54,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:16:54,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,275 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 103 [2024-11-08 12:16:54,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:16:54,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:16:54,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:16:54,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:16:54,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,320 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-08 12:16:54,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:16:54,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:16:54,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:16:54,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:16:54,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (1/1) ... [2024-11-08 12:16:54,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:16:54,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:16:54,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:16:54,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:16:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:16:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 12:16:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 12:16:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 12:16:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 12:16:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 12:16:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:16:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:16:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 12:16:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 12:16:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 12:16:54,577 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:16:54,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:16:59,086 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 12:16:59,086 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:16:59,100 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:16:59,101 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:16:59,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:16:59 BoogieIcfgContainer [2024-11-08 12:16:59,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:16:59,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:16:59,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:16:59,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:16:59,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:16:53" (1/3) ... [2024-11-08 12:16:59,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233ceabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:16:59, skipping insertion in model container [2024-11-08 12:16:59,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:16:54" (2/3) ... [2024-11-08 12:16:59,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233ceabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:16:59, skipping insertion in model container [2024-11-08 12:16:59,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:16:59" (3/3) ... [2024-11-08 12:16:59,114 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-11-08 12:16:59,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:16:59,131 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:16:59,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:16:59,188 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b09f067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:16:59,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:16:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 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) [2024-11-08 12:16:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 12:16:59,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:16:59,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:16:59,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:16:59,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:16:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2024-11-08 12:16:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:16:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711241234] [2024-11-08 12:16:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:16:59,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:16:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:16:59,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:16:59,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 12:16:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:16:59,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 12:16:59,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:16:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:16:59,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:16:59,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:16:59,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711241234] [2024-11-08 12:16:59,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711241234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:16:59,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:16:59,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:16:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82679078] [2024-11-08 12:16:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:16:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:16:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:16:59,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:16:59,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:16:59,545 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-08 12:17:03,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:07,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:12,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:17:12,461 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-08 12:17:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:17:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-08 12:17:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:17:12,542 INFO L225 Difference]: With dead ends: 32 [2024-11-08 12:17:12,542 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 12:17:12,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:17:12,547 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-08 12:17:12,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2024-11-08 12:17:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 12:17:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-08 12:17:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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) [2024-11-08 12:17:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-08 12:17:12,573 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2024-11-08 12:17:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:17:12,574 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-08 12:17:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-08 12:17:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-08 12:17:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 12:17:12,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:17:12,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:17:12,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 12:17:12,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:17:12,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:17:12,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:17:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2024-11-08 12:17:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:17:12,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409887549] [2024-11-08 12:17:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:17:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:17:12,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:17:12,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:17:12,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 12:17:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:17:13,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:17:13,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:17:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:17:13,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:17:13,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:17:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409887549] [2024-11-08 12:17:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409887549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:17:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:17:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:17:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914541460] [2024-11-08 12:17:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:17:13,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:17:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:17:13,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:17:13,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:17:13,593 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-08 12:17:17,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:21,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:25,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:30,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:34,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:17:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:17:34,157 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-08 12:17:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:17:34,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-08 12:17:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:17:34,234 INFO L225 Difference]: With dead ends: 28 [2024-11-08 12:17:34,234 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 12:17:34,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:17:34,235 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:17:34,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2024-11-08 12:17:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 12:17:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-08 12:17:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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) [2024-11-08 12:17:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-08 12:17:34,241 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2024-11-08 12:17:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:17:34,241 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-08 12:17:34,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-08 12:17:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-08 12:17:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 12:17:34,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:17:34,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:17:34,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 12:17:34,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:17:34,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:17:34,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:17:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2024-11-08 12:17:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:17:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483648133] [2024-11-08 12:17:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:17:34,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:17:34,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:17:34,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:17:34,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 12:17:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:17:35,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 12:17:35,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:17:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:17:35,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:17:35,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:17:35,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483648133] [2024-11-08 12:17:35,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483648133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:17:35,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:17:35,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:17:35,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257704408] [2024-11-08 12:17:35,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:17:35,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:17:35,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:17:35,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:17:35,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:17:35,201 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-08 12:17:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:17:35,313 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-08 12:17:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:17:35,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-08 12:17:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:17:35,316 INFO L225 Difference]: With dead ends: 24 [2024-11-08 12:17:35,317 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 12:17:35,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:17:35,318 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:17:35,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:17:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 12:17:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-08 12:17:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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) [2024-11-08 12:17:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-08 12:17:35,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-11-08 12:17:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:17:35,342 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-08 12:17:35,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-08 12:17:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-08 12:17:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 12:17:35,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:17:35,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:17:35,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 12:17:35,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:17:35,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:17:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:17:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2024-11-08 12:17:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:17:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094356565] [2024-11-08 12:17:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:17:35,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:17:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:17:35,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:17:35,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 12:17:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:17:36,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 12:17:36,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:17:45,332 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 12:17:53,618 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 12:18:01,902 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 12:18:10,253 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 12:18:18,545 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 12:18:22,652 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false