./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 00:41:17,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:41:17,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:41:17,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:41:17,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:41:17,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:41:17,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:41:17,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:41:17,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:41:17,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:41:17,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:41:17,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:41:17,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:41:17,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:41:17,795 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:41:17,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:41:17,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:41:17,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:41:17,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:41:17,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:41:17,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:41:17,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:41:17,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:41:17,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:41:17,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:41:17,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:41:17,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:41:17,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:41:17,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:41:17,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:41:17,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:41:17,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:41:17,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:41:17,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:41:17,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:41:17,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:41:17,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:41:17,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:41:17,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:41:17,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:41:17,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:41:17,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:41:17,805 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 00:41:18,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:41:18,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:41:18,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:41:18,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:41:18,051 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:41:18,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2024-09-13 00:41:19,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:41:19,704 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:41:19,705 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2024-09-13 00:41:19,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/26ebea1da/993027e84c764bf29597f56e3a04f7e6/FLAG21ef6d042 [2024-09-13 00:41:19,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/26ebea1da/993027e84c764bf29597f56e3a04f7e6 [2024-09-13 00:41:19,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:41:19,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:41:19,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:41:19,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:41:19,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:41:19,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:41:19" (1/1) ... [2024-09-13 00:41:19,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef8e96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:19, skipping insertion in model container [2024-09-13 00:41:19,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:41:19" (1/1) ... [2024-09-13 00:41:19,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:41:19,961 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2024-09-13 00:41:19,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:41:20,006 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:41:20,016 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2024-09-13 00:41:20,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:41:20,038 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:41:20,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20 WrapperNode [2024-09-13 00:41:20,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:41:20,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:41:20,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:41:20,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:41:20,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,059 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:41:20,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:41:20,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:41:20,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:41:20,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:41:20,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,094 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 00:41:20,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:41:20,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:41:20,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:41:20,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:41:20,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (1/1) ... [2024-09-13 00:41:20,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:41:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:41:20,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 00:41:20,149 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 00:41:20,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:41:20,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:41:20,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:41:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:41:20,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:41:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:41:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:41:20,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:41:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:41:20,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:41:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:41:20,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:41:20,259 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:41:20,261 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:41:20,396 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-13 00:41:20,396 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:41:20,425 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:41:20,426 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 00:41:20,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:41:20 BoogieIcfgContainer [2024-09-13 00:41:20,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:41:20,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:41:20,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:41:20,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:41:20,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:41:19" (1/3) ... [2024-09-13 00:41:20,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17824d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:41:20, skipping insertion in model container [2024-09-13 00:41:20,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:20" (2/3) ... [2024-09-13 00:41:20,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17824d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:41:20, skipping insertion in model container [2024-09-13 00:41:20,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:41:20" (3/3) ... [2024-09-13 00:41:20,436 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound1.c [2024-09-13 00:41:20,452 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:41:20,453 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:41:20,514 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:41:20,520 INFO L336 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=All, 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;@7fccb54d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:41:20,521 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:41:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 00:41:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:41:20,532 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:41:20,532 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:41:20,533 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:41:20,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:41:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-13 00:41:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:41:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808269979] [2024-09-13 00:41:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:41:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:41:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:41:20,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:41:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:41:20,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:41:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:41:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:41:20,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:41:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808269979] [2024-09-13 00:41:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808269979] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:41:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:41:20,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:41:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471309264] [2024-09-13 00:41:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:41:20,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:41:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:41:20,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:41:20,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:41:20,754 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:41:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:41:20,780 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-13 00:41:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:41:20,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 00:41:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:41:20,788 INFO L225 Difference]: With dead ends: 42 [2024-09-13 00:41:20,789 INFO L226 Difference]: Without dead ends: 21 [2024-09-13 00:41:20,791 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:41:20,798 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:41:20,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:41:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-13 00:41:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-13 00:41:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 00:41:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-13 00:41:20,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-13 00:41:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:41:20,833 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-13 00:41:20,834 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:41:20,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:41:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-13 00:41:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:41:20,835 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:41:20,835 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:41:20,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:41:20,836 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:41:20,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:41:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-13 00:41:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:41:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58336214] [2024-09-13 00:41:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:41:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:41:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:41:20,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 00:41:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:41:20,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-13 00:41:20,897 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-13 00:41:20,898 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 00:41:20,900 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 00:41:20,903 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-13 00:41:20,918 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 00:41:20,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 12:41:20 BoogieIcfgContainer [2024-09-13 00:41:20,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 00:41:20,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 00:41:20,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 00:41:20,922 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 00:41:20,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:41:20" (3/4) ... [2024-09-13 00:41:20,924 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-09-13 00:41:20,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 00:41:20,926 INFO L158 Benchmark]: Toolchain (without parser) took 1180.71ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 66.1MB in the beginning and 85.8MB in the end (delta: -19.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-09-13 00:41:20,927 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:41:20,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.52ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 65.9MB in the beginning and 126.4MB in the end (delta: -60.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-09-13 00:41:20,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.37ms. Allocated memory is still 155.2MB. Free memory was 126.4MB in the beginning and 124.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 00:41:20,930 INFO L158 Benchmark]: Boogie Preprocessor took 45.35ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 123.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 00:41:20,930 INFO L158 Benchmark]: RCFGBuilder took 320.13ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 111.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 00:41:20,930 INFO L158 Benchmark]: TraceAbstraction took 492.06ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 85.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-09-13 00:41:20,931 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 155.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:41:20,936 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.20ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.52ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 65.9MB in the beginning and 126.4MB in the end (delta: -60.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.37ms. Allocated memory is still 155.2MB. Free memory was 126.4MB in the beginning and 124.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.35ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 123.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.13ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 111.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 492.06ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 85.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 155.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=1) VAL [\old(cond)=1] [L14] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(a>=0 && a<=1) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L19] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-09-13 00:41:20,968 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 00:41:22,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:41:23,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-13 00:41:23,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:41:23,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:41:23,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:41:23,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:41:23,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:41:23,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:41:23,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:41:23,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:41:23,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:41:23,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:41:23,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:41:23,109 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:41:23,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:41:23,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:41:23,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:41:23,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:41:23,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:41:23,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:41:23,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:41:23,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:41:23,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-13 00:41:23,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-13 00:41:23,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:41:23,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-13 00:41:23,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:41:23,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:41:23,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:41:23,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:41:23,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:41:23,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:41:23,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:41:23,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:41:23,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:41:23,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:41:23,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:41:23,123 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-13 00:41:23,124 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-13 00:41:23,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:41:23,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:41:23,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:41:23,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:41:23,125 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-13 00:41:23,125 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 00:41:23,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:41:23,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:41:23,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:41:23,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:41:23,468 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:41:23,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2024-09-13 00:41:24,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:41:25,210 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:41:25,211 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2024-09-13 00:41:25,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/873d32f9d/0c54c547a4544fd0beeac5fae356dbec/FLAG7345b3be4 [2024-09-13 00:41:25,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/873d32f9d/0c54c547a4544fd0beeac5fae356dbec [2024-09-13 00:41:25,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:41:25,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:41:25,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:41:25,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:41:25,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:41:25,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29dfb1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25, skipping insertion in model container [2024-09-13 00:41:25,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:41:25,748 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2024-09-13 00:41:25,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:41:25,782 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:41:25,795 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2024-09-13 00:41:25,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:41:25,824 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:41:25,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25 WrapperNode [2024-09-13 00:41:25,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:41:25,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:41:25,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:41:25,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:41:25,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,857 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:41:25,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:41:25,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:41:25,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:41:25,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:41:25,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,887 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 00:41:25,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:41:25,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:41:25,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:41:25,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:41:25,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (1/1) ... [2024-09-13 00:41:25,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:41:25,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:41:25,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 00:41:25,962 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 00:41:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:41:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-13 00:41:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:41:26,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:41:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:41:26,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:41:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:41:26,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:41:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:41:26,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:41:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:41:26,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:41:26,078 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:41:26,080 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:41:26,906 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-13 00:41:26,906 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:41:26,933 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:41:26,934 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 00:41:26,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:41:26 BoogieIcfgContainer [2024-09-13 00:41:26,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:41:26,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:41:26,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:41:26,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:41:26,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:41:25" (1/3) ... [2024-09-13 00:41:26,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a31222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:41:26, skipping insertion in model container [2024-09-13 00:41:26,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:41:25" (2/3) ... [2024-09-13 00:41:26,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a31222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:41:26, skipping insertion in model container [2024-09-13 00:41:26,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:41:26" (3/3) ... [2024-09-13 00:41:26,944 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound1.c [2024-09-13 00:41:26,960 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:41:26,960 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:41:27,019 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:41:27,026 INFO L336 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=All, 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;@4154e856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:41:27,027 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:41:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 00:41:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:41:27,036 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:41:27,036 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:41:27,037 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:41:27,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:41:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-13 00:41:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:41:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749185181] [2024-09-13 00:41:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:41:27,054 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-09-13 00:41:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:41:27,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:41:27,059 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:41:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:41:27,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-13 00:41:27,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:41:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:41:27,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 00:41:27,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 00:41:27,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749185181] [2024-09-13 00:41:27,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749185181] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:41:27,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:41:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:41:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147867416] [2024-09-13 00:41:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:41:27,379 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:41:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 00:41:27,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:41:27,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:41:27,402 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:41:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:41:27,435 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-13 00:41:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:41:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 00:41:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:41:27,442 INFO L225 Difference]: With dead ends: 42 [2024-09-13 00:41:27,443 INFO L226 Difference]: Without dead ends: 21 [2024-09-13 00:41:27,445 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:41:27,448 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:41:27,449 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:41:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-13 00:41:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-13 00:41:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 00:41:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-13 00:41:27,476 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-13 00:41:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:41:27,476 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-13 00:41:27,477 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:41:27,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:41:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-13 00:41:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:41:27,478 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:41:27,479 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:41:27,494 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:41:27,679 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:41:27,680 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:41:27,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:41:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-13 00:41:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:41:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356673954] [2024-09-13 00:41:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:41:27,690 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-09-13 00:41:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:41:27,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:41:27,695 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:41:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:41:27,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 00:41:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:41:28,215 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-13 00:41:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1470976380] [2024-09-13 00:41:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:41:28,216 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 00:41:28,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 00:41:28,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-13 00:41:28,243 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-09-13 00:41:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:41:28,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 00:41:28,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:41:48,350 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:41:55,795 WARN L293 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:42:03,897 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:42:07,942 WARN L854 $PredicateComparison]: unable to prove that (or (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2024-09-13 00:42:19,650 WARN L293 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:42:32,037 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:42:36,068 WARN L854 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0))))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) is different from false [2024-09-13 00:42:45,265 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:42:57,786 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:43:01,816 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from false [2024-09-13 00:43:05,841 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from true [2024-09-13 00:43:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:43:05,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 00:43:05,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 00:43:05,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356673954] [2024-09-13 00:43:05,843 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:43:05,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1470976380] [2024-09-13 00:43:05,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1470976380] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:43:05,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:43:05,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-13 00:43:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400588716] [2024-09-13 00:43:05,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:43:05,845 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-13 00:43:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 00:43:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-13 00:43:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=39, Unknown=4, NotChecked=42, Total=110 [2024-09-13 00:43:05,846 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 00:43:14,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:44:07,618 WARN L293 SmtUtils]: Spent 41.21s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:44:10,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 00:45:05,326 WARN L293 SmtUtils]: Spent 32.68s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:45:09,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 00:45:13,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 00:45:17,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 00:45:21,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 00:45:25,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 00:45:29,489 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |c_#memory_int#0| (_ bv1 32)) (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-09-13 00:45:30,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:34,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:38,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:42,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:44,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:49,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:53,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:57,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:45:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:45:57,574 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-09-13 00:45:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 00:45:57,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-13 00:45:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:45:57,618 INFO L225 Difference]: With dead ends: 29 [2024-09-13 00:45:57,618 INFO L226 Difference]: Without dead ends: 27 [2024-09-13 00:45:57,618 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 135.3s TimeCoverageRelationStatistics Valid=57, Invalid=132, Unknown=9, NotChecked=108, Total=306 [2024-09-13 00:45:57,619 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 56.4s IncrementalHoareTripleChecker+Time [2024-09-13 00:45:57,620 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 10 Unknown, 84 Unchecked, 56.4s Time] [2024-09-13 00:45:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-13 00:45:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-09-13 00:45:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:45:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-09-13 00:45:57,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2024-09-13 00:45:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:45:57,630 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-09-13 00:45:57,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 00:45:57,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:45:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-09-13 00:45:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 00:45:57,632 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:45:57,632 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:45:57,659 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:45:57,841 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-09-13 00:45:58,033 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/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 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-13 00:45:58,034 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:45:58,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:45:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash -711167633, now seen corresponding path program 1 times [2024-09-13 00:45:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:45:58,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976186709] [2024-09-13 00:45:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:45:58,035 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-09-13 00:45:58,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:45:58,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:45:58,037 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:45:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:45:58,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-13 00:45:58,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:46:06,596 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:46:10,637 WARN L854 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_main_~r~0 c_main_~r~0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_main_~x~0)))) is different from false [2024-09-13 00:46:14,677 WARN L876 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_main_~r~0 c_main_~r~0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_main_~x~0)))) is different from true [2024-09-13 00:46:22,761 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:46:34,910 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:46:38,952 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2024-09-13 00:46:51,103 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:46:55,145 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) is different from false [2024-09-13 00:46:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-13 00:46:55,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:47:03,342 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:47:11,426 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:47:27,722 WARN L293 SmtUtils]: Spent 16.25s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-13 00:47:43,976 WARN L293 SmtUtils]: Spent 16.25s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-13 00:47:52,090 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:47:56,158 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((v_main_~x~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~r~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_3 (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_3 v_main_~r~0_BEFORE_CALL_3)) v_main_~a~0_BEFORE_CALL_3) ((_ to_fp 11 53) c_currentRoundingMode v_main_~r~0_BEFORE_CALL_3)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_3))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from true [2024-09-13 00:48:04,261 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:48:12,400 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:48:16,480 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((v_main_~x~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~r~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_3 (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_3 v_main_~r~0_BEFORE_CALL_3)) v_main_~a~0_BEFORE_CALL_3) ((_ to_fp 11 53) c_currentRoundingMode v_main_~r~0_BEFORE_CALL_3)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_3))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from true [2024-09-13 00:48:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-13 00:48:16,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 00:48:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976186709] [2024-09-13 00:48:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976186709] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:48:16,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:48:16,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-13 00:48:16,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58704056] [2024-09-13 00:48:16,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:48:16,546 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 00:48:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 00:48:16,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 00:48:16,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2024-09-13 00:48:16,547 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 00:48:20,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:48:24,714 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-09-13 00:48:28,832 WARN L876 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((v_main_~x~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~r~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_3 (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_3 v_main_~r~0_BEFORE_CALL_3)) v_main_~a~0_BEFORE_CALL_3) ((_ to_fp 11 53) c_currentRoundingMode v_main_~r~0_BEFORE_CALL_3)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_3))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) is different from true [2024-09-13 00:48:32,887 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) (and .cse0 (or (forall ((v_main_~x~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~r~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_3 (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_3 v_main_~r~0_BEFORE_CALL_3)) v_main_~a~0_BEFORE_CALL_3) ((_ to_fp 11 53) c_currentRoundingMode v_main_~r~0_BEFORE_CALL_3)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_3))))) .cse0))) is different from true [2024-09-13 00:48:36,934 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2024-09-13 00:48:40,989 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 (forall ((v_main_~x~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~r~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_3 (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_3 v_main_~r~0_BEFORE_CALL_3)) v_main_~a~0_BEFORE_CALL_3) ((_ to_fp 11 53) c_currentRoundingMode v_main_~r~0_BEFORE_CALL_3)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_3))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (not .cse0) (= (_ bv1 32) c___VERIFIER_assert_~cond))) is different from false [2024-09-13 00:48:45,033 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 (forall ((v_main_~x~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~r~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_3 (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_3 v_main_~r~0_BEFORE_CALL_3)) v_main_~a~0_BEFORE_CALL_3) ((_ to_fp 11 53) c_currentRoundingMode v_main_~r~0_BEFORE_CALL_3)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_3))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (not .cse0) (= (_ bv1 32) c___VERIFIER_assert_~cond))) is different from true [2024-09-13 00:48:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:48:45,036 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-09-13 00:48:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 00:48:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 22 [2024-09-13 00:48:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:48:45,039 INFO L225 Difference]: With dead ends: 29 [2024-09-13 00:48:45,039 INFO L226 Difference]: Without dead ends: 24 [2024-09-13 00:48:45,039 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2024-09-13 00:48:45,040 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:48:45,041 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 115 Unchecked, 8.2s Time] [2024-09-13 00:48:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-13 00:48:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-13 00:48:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:48:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-09-13 00:48:45,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2024-09-13 00:48:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:48:45,050 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-09-13 00:48:45,051 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 00:48:45,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:48:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-09-13 00:48:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 00:48:45,052 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:48:45,052 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:48:45,068 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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)] Ended with exit code 0 [2024-09-13 00:48:45,256 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:48:45,257 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:48:45,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:48:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -543150969, now seen corresponding path program 1 times [2024-09-13 00:48:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:48:45,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466688207] [2024-09-13 00:48:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:48:45,258 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-09-13 00:48:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:48:45,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 00:48:45,260 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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 (6)] Waiting until timeout for monitored process [2024-09-13 00:48:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:48:45,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 00:48:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:48:46,245 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-13 00:48:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1776255233] [2024-09-13 00:48:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:48:46,246 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 00:48:46,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 00:48:46,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-13 00:48:46,248 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-09-13 00:48:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:48:49,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-13 00:48:49,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:49:42,226 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:49:50,394 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:50:07,051 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:50:15,227 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:50:23,402 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:50:27,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((v_main_~a~0_BEFORE_CALL_5 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 .cse4))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_5) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (fp.gt .cse2 .cse3) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse0)))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (and (exists ((v_main_~a~0_BEFORE_CALL_5 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 .cse4))) (and (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_5) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse5 .cse3))))) (fp.gt .cse5 .cse3) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse0)))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) is different from false [2024-09-13 00:50:39,712 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:50:47,889 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:51:03,545 WARN L293 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:51:11,726 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:51:19,909 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:51:24,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((v_main_~a~0_BEFORE_CALL_5 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 .cse4))) (and (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_5) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3))))) (fp.gt .cse2 .cse3) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse0)))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_main_~a~0_BEFORE_CALL_5 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 .cse4))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_5) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse5 .cse3)))))) (fp.gt .cse5 .cse3) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse0))))))) is different from false [2024-09-13 00:51:36,186 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:51:44,364 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:51:52,545 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:51:56,589 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_5 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_5) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) (fp.gt .cse1 .cse2) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse0)))) is different from false [2024-09-13 00:52:00,626 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_5 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_5) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) (fp.gt .cse1 .cse2) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse0)))) is different from true [2024-09-13 00:52:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-13 00:52:00,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:52:10,428 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:52:14,475 WARN L854 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_main_~r~0 c_main_~r~0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_main_~x~0)))) is different from false [2024-09-13 00:52:18,521 WARN L876 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_main_~r~0 c_main_~r~0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_main_~x~0)))) is different from true [2024-09-13 00:52:26,617 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:52:34,756 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:52:42,992 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:52:47,058 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) c_main_~r~0))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_main_~x~0 .cse1))))) (not (fp.gt c_main_~x~0 .cse1)))) is different from false [2024-09-13 00:52:51,121 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) c_main_~r~0))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_main_~x~0 .cse1))))) (not (fp.gt c_main_~x~0 .cse1)))) is different from true [2024-09-13 00:52:59,310 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:53:07,537 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:53:15,688 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:53:23,908 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:53:32,097 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:53:40,218 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:53:44,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 c_main_~a~0) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2024-09-13 00:53:48,312 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 c_main_~a~0) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2024-09-13 00:53:56,838 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:54:04,965 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:54:12,628 WARN L293 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:54:16,667 WARN L854 $PredicateComparison]: unable to prove that (forall ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse0 (fp.div c_currentRoundingMode main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (not (fp.leq main_~a~0 .cse2)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 main_~a~0) .cse2) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))))))) is different from false [2024-09-13 00:54:20,715 WARN L876 $PredicateComparison]: unable to prove that (forall ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse0 (fp.div c_currentRoundingMode main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (not (fp.leq main_~a~0 .cse2)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 main_~a~0) .cse2) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))))))) is different from true [2024-09-13 00:54:20,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 00:54:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466688207] [2024-09-13 00:54:20,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:54:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1776255233] [2024-09-13 00:54:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1776255233] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:54:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198866861] [2024-09-13 00:54:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:54:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:54:20,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:54:20,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:54:20,719 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Killed by 15