./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.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_valuebound20.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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --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:52:20,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:52:20,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:52:20,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:52:20,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:52:20,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:52:20,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:52:20,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:52:20,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:52:20,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:52:20,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:52:20,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:52:20,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:52:20,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:52:20,663 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:52:20,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:52:20,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:52:20,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:52:20,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:52:20,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:52:20,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:52:20,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:52:20,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:52:20,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:52:20,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:52:20,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:52:20,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:52:20,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:52:20,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:52:20,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:52:20,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:52:20,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:52:20,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:52:20,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:52:20,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:52:20,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:52:20,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:52:20,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:52:20,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:52:20,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:52:20,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:52:20,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:52:20,676 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a 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:52:20,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:52:20,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:52:20,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:52:20,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:52:20,885 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:52:20,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-13 00:52:22,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:52:22,289 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:52:22,290 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-13 00:52:22,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/22092b975/6013534311c24b4aa99ce7943b18d48f/FLAGf698044d7 [2024-09-13 00:52:22,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/22092b975/6013534311c24b4aa99ce7943b18d48f [2024-09-13 00:52:22,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:52:22,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:52:22,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:52:22,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:52:22,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:52:22,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1212a874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22, skipping insertion in model container [2024-09-13 00:52:22,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:52:22,446 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_valuebound20.c[712,725] [2024-09-13 00:52:22,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:52:22,472 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:52:22,480 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_valuebound20.c[712,725] [2024-09-13 00:52:22,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:52:22,500 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:52:22,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22 WrapperNode [2024-09-13 00:52:22,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:52:22,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:52:22,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:52:22,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:52:22,508 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:52:22" (1/1) ... [2024-09-13 00:52:22,514 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:52:22" (1/1) ... [2024-09-13 00:52:22,520 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:52:22,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:52:22,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:52:22,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:52:22,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:52:22,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,542 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:52:22,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:52:22,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:52:22,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:52:22,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:52:22,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (1/1) ... [2024-09-13 00:52:22,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:52:22,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:52:22,579 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:52:22,584 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:52:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:52:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:52:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:52:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:52:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:52:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:52:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:52:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:52:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:52:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:52:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:52:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:52:22,661 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:52:22,663 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:52:22,752 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-13 00:52:22,753 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:52:22,786 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:52:22,787 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 00:52:22,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:52:22 BoogieIcfgContainer [2024-09-13 00:52:22,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:52:22,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:52:22,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:52:22,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:52:22,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:52:22" (1/3) ... [2024-09-13 00:52:22,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e49ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:52:22, skipping insertion in model container [2024-09-13 00:52:22,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:22" (2/3) ... [2024-09-13 00:52:22,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e49ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:52:22, skipping insertion in model container [2024-09-13 00:52:22,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:52:22" (3/3) ... [2024-09-13 00:52:22,793 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2024-09-13 00:52:22,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:52:22,808 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:52:22,847 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:52:22,852 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;@30f92f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:52:22,852 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:52:22,855 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:52:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:52:22,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:52:22,861 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:52:22,862 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:52:22,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:52:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-13 00:52:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:52:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850891419] [2024-09-13 00:52:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:52:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:52:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:52:22,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:52:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:52:22,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:52:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:52:23,006 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:52:23,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:52:23,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850891419] [2024-09-13 00:52:23,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850891419] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:52:23,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:52:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:52:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200814653] [2024-09-13 00:52:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:52:23,015 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:52:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:52:23,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:52:23,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:52:23,037 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:52:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:52:23,062 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-13 00:52:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:52:23,066 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:52:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:52:23,072 INFO L225 Difference]: With dead ends: 42 [2024-09-13 00:52:23,072 INFO L226 Difference]: Without dead ends: 21 [2024-09-13 00:52:23,075 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:52:23,079 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:52:23,081 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:52:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-13 00:52:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-13 00:52:23,127 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:52:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-13 00:52:23,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-13 00:52:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:52:23,133 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-13 00:52:23,134 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:52:23,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:52:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-13 00:52:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:52:23,135 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:52:23,135 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:52:23,135 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:52:23,140 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:52:23,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:52:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-13 00:52:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:52:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281344454] [2024-09-13 00:52:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:52:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:52:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:52:23,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 00:52:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:52:23,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-13 00:52:23,204 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-13 00:52:23,205 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 00:52:23,207 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 00:52:23,210 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-13 00:52:23,221 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 00:52:23,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 12:52:23 BoogieIcfgContainer [2024-09-13 00:52:23,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 00:52:23,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 00:52:23,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 00:52:23,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 00:52:23,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:52:22" (3/4) ... [2024-09-13 00:52:23,225 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-09-13 00:52:23,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 00:52:23,227 INFO L158 Benchmark]: Toolchain (without parser) took 918.12ms. Allocated memory is still 188.7MB. Free memory was 120.7MB in the beginning and 155.4MB in the end (delta: -34.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:52:23,227 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 188.7MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:52:23,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.35ms. Allocated memory is still 188.7MB. Free memory was 120.5MB in the beginning and 109.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 00:52:23,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.42ms. Allocated memory is still 188.7MB. Free memory was 109.0MB in the beginning and 108.1MB in the end (delta: 908.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:52:23,230 INFO L158 Benchmark]: Boogie Preprocessor took 31.11ms. Allocated memory is still 188.7MB. Free memory was 108.1MB in the beginning and 106.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 00:52:23,230 INFO L158 Benchmark]: RCFGBuilder took 234.58ms. Allocated memory is still 188.7MB. Free memory was 106.3MB in the beginning and 160.6MB in the end (delta: -54.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-09-13 00:52:23,231 INFO L158 Benchmark]: TraceAbstraction took 434.70ms. Allocated memory is still 188.7MB. Free memory was 160.6MB in the beginning and 155.4MB in the end (delta: 5.1MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-09-13 00:52:23,231 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 188.7MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:52:23,235 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.19ms. Allocated memory is still 188.7MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.35ms. Allocated memory is still 188.7MB. Free memory was 120.5MB in the beginning and 109.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.42ms. Allocated memory is still 188.7MB. Free memory was 109.0MB in the beginning and 108.1MB in the end (delta: 908.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.11ms. Allocated memory is still 188.7MB. Free memory was 108.1MB in the beginning and 106.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.58ms. Allocated memory is still 188.7MB. Free memory was 106.3MB in the beginning and 160.6MB in the end (delta: -54.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 434.70ms. Allocated memory is still 188.7MB. Free memory was 160.6MB in the beginning and 155.4MB in the end (delta: 5.1MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 188.7MB. Free memory is still 155.4MB. 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<=20) VAL [\old(cond)=1] [L14] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(a>=0 && a<=20) [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.1s 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:52:23,258 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_valuebound20.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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --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:52:25,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:52:25,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-13 00:52:25,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:52:25,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:52:25,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:52:25,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:52:25,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:52:25,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:52:25,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:52:25,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:52:25,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:52:25,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:52:25,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:52:25,276 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:52:25,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:52:25,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:52:25,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:52:25,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:52:25,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:52:25,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:52:25,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:52:25,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:52:25,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-13 00:52:25,280 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-13 00:52:25,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:52:25,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-13 00:52:25,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:52:25,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:52:25,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:52:25,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:52:25,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:52:25,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:52:25,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:52:25,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:52:25,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:52:25,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:52:25,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:52:25,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-13 00:52:25,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-13 00:52:25,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:52:25,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:52:25,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:52:25,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:52:25,286 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-13 00:52:25,286 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a 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:52:25,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:52:25,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:52:25,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:52:25,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:52:25,541 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:52:25,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-13 00:52:26,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:52:27,035 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:52:27,035 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-13 00:52:27,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/08869c1f0/16d370ec169e445aa7d855ecf3f98a79/FLAG53660646a [2024-09-13 00:52:27,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/08869c1f0/16d370ec169e445aa7d855ecf3f98a79 [2024-09-13 00:52:27,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:52:27,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:52:27,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:52:27,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:52:27,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:52:27,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d46d42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27, skipping insertion in model container [2024-09-13 00:52:27,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:52:27,599 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_valuebound20.c[712,725] [2024-09-13 00:52:27,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:52:27,634 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:52:27,644 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_valuebound20.c[712,725] [2024-09-13 00:52:27,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:52:27,665 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:52:27,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27 WrapperNode [2024-09-13 00:52:27,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:52:27,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:52:27,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:52:27,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:52:27,673 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:52:27" (1/1) ... [2024-09-13 00:52:27,680 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:52:27" (1/1) ... [2024-09-13 00:52:27,686 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:52:27,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:52:27,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:52:27,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:52:27,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:52:27,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,711 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:52:27,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:52:27,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:52:27,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:52:27,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:52:27,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (1/1) ... [2024-09-13 00:52:27,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:52:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:52:27,763 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:52:27,769 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:52:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:52:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-13 00:52:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:52:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:52:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:52:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:52:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:52:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:52:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:52:27,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:52:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:52:27,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:52:27,869 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:52:27,872 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:52:28,771 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-13 00:52:28,772 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:52:28,794 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:52:28,794 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 00:52:28,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:52:28 BoogieIcfgContainer [2024-09-13 00:52:28,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:52:28,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:52:28,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:52:28,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:52:28,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:52:27" (1/3) ... [2024-09-13 00:52:28,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4136f0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:52:28, skipping insertion in model container [2024-09-13 00:52:28,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:52:27" (2/3) ... [2024-09-13 00:52:28,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4136f0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:52:28, skipping insertion in model container [2024-09-13 00:52:28,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:52:28" (3/3) ... [2024-09-13 00:52:28,805 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2024-09-13 00:52:28,821 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:52:28,822 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:52:28,879 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:52:28,888 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;@569c4a3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:52:28,888 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:52:28,892 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:52:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:52:28,899 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:52:28,900 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:52:28,900 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:52:28,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:52:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-13 00:52:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:52:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769309579] [2024-09-13 00:52:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:52:28,918 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:52:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:52:28,921 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:52:28,922 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:52:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:52:29,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-13 00:52:29,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:52:29,243 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:52:29,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 00:52:29,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 00:52:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769309579] [2024-09-13 00:52:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769309579] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:52:29,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:52:29,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:52:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834854914] [2024-09-13 00:52:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:52:29,250 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:52:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 00:52:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:52:29,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:52:29,270 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:52:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:52:29,295 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-13 00:52:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:52:29,298 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:52:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:52:29,306 INFO L225 Difference]: With dead ends: 42 [2024-09-13 00:52:29,306 INFO L226 Difference]: Without dead ends: 21 [2024-09-13 00:52:29,309 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:52:29,311 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:52:29,312 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:52:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-13 00:52:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-13 00:52:29,335 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:52:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-13 00:52:29,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-13 00:52:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:52:29,337 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-13 00:52:29,337 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:52:29,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:52:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-13 00:52:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 00:52:29,339 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:52:29,339 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:52:29,351 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:52:29,543 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:52:29,543 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:52:29,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:52:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-13 00:52:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:52:29,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127976040] [2024-09-13 00:52:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:52:29,545 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:52:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:52:29,546 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:52:29,549 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:52:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:52:29,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 00:52:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:52:30,061 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-13 00:52:30,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1499850813] [2024-09-13 00:52:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:52:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 00:52:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 00:52:30,064 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:52:30,065 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:52:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:52:30,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 00:52:30,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:52:53,187 WARN L293 SmtUtils]: Spent 7.13s 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:58,920 WARN L293 SmtUtils]: Spent 5.73s 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:53:08,203 WARN L854 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (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 (_ bv20 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from false [2024-09-13 00:53:20,347 WARN L293 SmtUtils]: Spent 8.07s 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:53:25,620 WARN L293 SmtUtils]: Spent 5.27s 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:53:33,742 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:53:37,777 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 (_ bv20 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:53:49,884 WARN L293 SmtUtils]: Spent 8.07s 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:53:57,074 WARN L293 SmtUtils]: Spent 7.19s 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:54:05,229 WARN L293 SmtUtils]: Spent 8.16s 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:54:09,262 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 (_ bv20 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from false [2024-09-13 00:54:13,289 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 (_ bv20 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from true [2024-09-13 00:54:13,290 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:54:13,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 00:54:13,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 00:54:13,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127976040] [2024-09-13 00:54:13,290 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:54:13,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1499850813] [2024-09-13 00:54:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1499850813] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:54:13,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:54:13,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-13 00:54:13,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379113246] [2024-09-13 00:54:13,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:54:13,292 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-13 00:54:13,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 00:54:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-13 00:54:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=39, Unknown=4, NotChecked=42, Total=110 [2024-09-13 00:54:13,293 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:54:15,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s 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:54:25,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s 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:54:29,160 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:54:31,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s 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:55:30,270 WARN L293 SmtUtils]: Spent 39.29s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:55:32,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s 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:55:36,395 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |c_#memory_int#0| (_ bv1 32)) (_ bv1 32))) (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 (_ bv20 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0))))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-09-13 00:55:39,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s 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:55:42,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s 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:55:47,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:55:51,086 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:55:55,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:55:59,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:56:03,261 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:56:07,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 00:56:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:56:08,096 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-13 00:56:08,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 00:56:08,135 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:56:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:56:08,136 INFO L225 Difference]: With dead ends: 31 [2024-09-13 00:56:08,136 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 00:56:08,136 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 90.7s TimeCoverageRelationStatistics Valid=53, Invalid=110, Unknown=9, NotChecked=100, Total=272 [2024-09-13 00:56:08,137 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 46.6s IncrementalHoareTripleChecker+Time [2024-09-13 00:56:08,137 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 56 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 8 Unknown, 97 Unchecked, 46.6s Time] [2024-09-13 00:56:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 00:56:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-13 00:56:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:56:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-13 00:56:08,144 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2024-09-13 00:56:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:56:08,145 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-13 00:56:08,145 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:56:08,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:56:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-13 00:56:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 00:56:08,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:56:08,146 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:56:08,169 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 (3)] Ended with exit code 0 [2024-09-13 00:56:08,356 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-09-13 00:56:08,547 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:56:08,547 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:56:08,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:56:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash -711167633, now seen corresponding path program 1 times [2024-09-13 00:56:08,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:56:08,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062805760] [2024-09-13 00:56:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:56:08,548 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:56:08,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:56:08,550 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:56:08,551 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:56:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:56:08,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-13 00:56:08,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:56:17,031 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:56:21,078 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:56:25,121 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:56:33,215 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:56:45,379 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:56:49,431 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:57:01,610 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:57:05,658 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:57:05,667 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:57:05,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:57:13,840 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:57:21,949 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:57:38,284 WARN L293 SmtUtils]: Spent 16.28s 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:57:54,581 WARN L293 SmtUtils]: Spent 16.30s 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:58:01,348 WARN L293 SmtUtils]: Spent 6.76s 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:58:05,421 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:58:13,537 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:58:21,681 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:58:25,757 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:58:25,820 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:58:25,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 00:58:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062805760] [2024-09-13 00:58:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062805760] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:58:25,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:58:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-13 00:58:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142032072] [2024-09-13 00:58:25,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:58:25,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 00:58:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 00:58:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 00:58:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2024-09-13 00:58:25,822 INFO L87 Difference]: Start difference. First operand 27 states and 28 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:58:29,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 00:58:33,985 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:58:38,098 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:58:42,157 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:58:46,212 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:58:50,269 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:58:54,311 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:58:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:58:54,314 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-09-13 00:58:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 00:58:54,314 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:58:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:58:54,316 INFO L225 Difference]: With dead ends: 31 [2024-09-13 00:58:54,316 INFO L226 Difference]: Without dead ends: 26 [2024-09-13 00:58:54,316 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:58:54,317 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:58:54,317 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:58:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-13 00:58:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-13 00:58:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:58:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-09-13 00:58:54,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2024-09-13 00:58:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:58:54,326 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-09-13 00:58:54,326 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:58:54,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:58:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-09-13 00:58:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 00:58:54,327 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:58:54,327 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:58:54,340 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:58:54,528 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:58:54,528 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:58:54,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:58:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -543150969, now seen corresponding path program 1 times [2024-09-13 00:58:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 00:58:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222518966] [2024-09-13 00:58:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:58:54,530 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:58:54,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 00:58:54,533 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:58:54,534 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:58:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:58:55,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 00:58:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 00:58:55,587 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-13 00:58:55,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [854488737] [2024-09-13 00:58:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:58:55,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 00:58:55,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 00:58:55,590 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:58:55,591 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:58:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:58:58,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-13 00:58:58,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:59:37,015 WARN L293 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:59:52,814 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 01:00:00,990 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 01:00:07,364 WARN L293 SmtUtils]: Spent 6.37s 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 01:00:19,529 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 01:00:27,700 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 01:00:35,871 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 01:00:39,979 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (.cse5 ((_ 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 .cse5))) (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 .cse4)))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (exists ((v_main_~a~0_BEFORE_CALL_5 (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 .cse5))) (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 .cse6 .cse3)))))) (fp.gt .cse6 .cse3) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse4)))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) is different from false [2024-09-13 01:00:52,245 WARN L293 SmtUtils]: Spent 8.15s 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 01:01:00,431 WARN L293 SmtUtils]: Spent 8.19s 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 01:01:17,028 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 01:01:23,621 WARN L293 SmtUtils]: Spent 6.59s 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 01:01:30,235 WARN L293 SmtUtils]: Spent 6.61s 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 01:01:34,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (.cse5 ((_ 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 .cse5))) (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 .cse4)))) (= (_ 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 ((.cse6 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_5 .cse5))) (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 .cse6 .cse3)))))) (fp.gt .cse6 .cse3) (fp.leq v_main_~a~0_BEFORE_CALL_5 .cse4))))))) is different from false [2024-09-13 01:01:46,501 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 01:01:54,674 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 01:02:02,237 WARN L293 SmtUtils]: Spent 7.56s 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 01:02:06,284 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)))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (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 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from false [2024-09-13 01:02:10,321 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)))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (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 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from true [2024-09-13 01:02:10,321 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 01:02:10,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:02:20,803 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 01:02:24,845 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 01:02:28,889 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 01:02:36,978 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 01:02:45,109 WARN L293 SmtUtils]: Spent 8.13s 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 01:02:53,341 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 01:02:57,402 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 01:03:01,459 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 01:03:09,631 WARN L293 SmtUtils]: Spent 8.13s 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 01:03:17,823 WARN L293 SmtUtils]: Spent 8.19s 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 01:03:25,952 WARN L293 SmtUtils]: Spent 8.13s 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 01:03:34,151 WARN L293 SmtUtils]: Spent 8.20s 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 01:03:41,796 WARN L293 SmtUtils]: Spent 7.64s 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 01:03:49,901 WARN L293 SmtUtils]: Spent 8.10s 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 01:03:53,943 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 01:03:57,984 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 01:04:03,958 WARN L293 SmtUtils]: Spent 5.83s 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 01:04:12,272 WARN L293 SmtUtils]: Spent 8.17s 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 01:04:20,378 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 01:04:24,413 WARN L854 $PredicateComparison]: unable to prove that (forall ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.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 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (= (_ bv0 32) ((_ 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 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 01:04:28,455 WARN L876 $PredicateComparison]: unable to prove that (forall ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.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 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (= (_ bv0 32) ((_ 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 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 01:04:28,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 01:04:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222518966] [2024-09-13 01:04:28,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:04:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [854488737] [2024-09-13 01:04:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [854488737] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:04:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419279134] [2024-09-13 01:04:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:04:28,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:04:28,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:04:28,458 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 01:04:28,458 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