./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound10.i --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/divbin_valuebound10.i -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 7cd88f875a58f4eeda0acf74fa673f6c9452a00f17e8b4a3e93b35765440e39d --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:07:22,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:07:22,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:07:22,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:07:22,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:07:22,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:07:22,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:07:22,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:07:22,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:07:22,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:07:22,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:07:22,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:07:22,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:07:22,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:07:22,218 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:07:22,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:07:22,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:07:22,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:07:22,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:07:22,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:07:22,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:07:22,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:07:22,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:07:22,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:07:22,224 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:07:22,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:07:22,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:07:22,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:07:22,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:07:22,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:07:22,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:07:22,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:07:22,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:07:22,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:07:22,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:07:22,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:07:22,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:07:22,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:07:22,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:07:22,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:07:22,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:07:22,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:07:22,229 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 -> 7cd88f875a58f4eeda0acf74fa673f6c9452a00f17e8b4a3e93b35765440e39d 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:07:22,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:07:22,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:07:22,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:07:22,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:07:22,516 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:07:22,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound10.i [2024-09-13 00:07:23,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:07:24,068 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:07:24,069 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound10.i [2024-09-13 00:07:24,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9b0dbc9b1/9f5d512371464db885da31c1ae22c494/FLAG6741627b1 [2024-09-13 00:07:24,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9b0dbc9b1/9f5d512371464db885da31c1ae22c494 [2024-09-13 00:07:24,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:07:24,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:07:24,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:07:24,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:07:24,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:07:24,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247d581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24, skipping insertion in model container [2024-09-13 00:07:24,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:07:24,650 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/divbin_valuebound10.i[950,963] [2024-09-13 00:07:24,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:07:24,689 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:07:24,702 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/divbin_valuebound10.i[950,963] [2024-09-13 00:07:24,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:07:24,730 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:07:24,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24 WrapperNode [2024-09-13 00:07:24,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:07:24,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:07:24,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:07:24,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:07:24,741 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:07:24" (1/1) ... [2024-09-13 00:07:24,748 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:07:24" (1/1) ... [2024-09-13 00:07:24,754 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:07:24,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:07:24,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:07:24,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:07:24,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:07:24,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,777 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:07:24,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:07:24,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:07:24,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:07:24,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:07:24,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (1/1) ... [2024-09-13 00:07:24,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:07:24,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:07:24,828 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:07:24,833 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:07:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:07:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:07:24,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:07:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:07:24,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:07:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:07:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:07:24,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:07:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:07:24,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:07:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:07:24,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:07:24,939 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:07:24,941 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:07:25,098 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 00:07:25,098 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:07:25,123 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:07:25,124 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 00:07:25,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:07:25 BoogieIcfgContainer [2024-09-13 00:07:25,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:07:25,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:07:25,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:07:25,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:07:25,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:07:24" (1/3) ... [2024-09-13 00:07:25,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ea05a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:07:25, skipping insertion in model container [2024-09-13 00:07:25,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:07:24" (2/3) ... [2024-09-13 00:07:25,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ea05a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:07:25, skipping insertion in model container [2024-09-13 00:07:25,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:07:25" (3/3) ... [2024-09-13 00:07:25,131 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound10.i [2024-09-13 00:07:25,147 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:07:25,147 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:07:25,197 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:07:25,205 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;@388cd163, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:07:25,205 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:07:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 00:07:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-13 00:07:25,217 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:07:25,217 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:07:25,218 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:07:25,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:07:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-09-13 00:07:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:07:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031535488] [2024-09-13 00:07:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:07:25,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:07:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:25,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:07:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:25,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:07:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:25,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:07:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:25,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:07:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:25,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:07:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:07:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:07:25,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031535488] [2024-09-13 00:07:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031535488] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:07:25,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:07:25,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:07:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188198435] [2024-09-13 00:07:25,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:07:25,476 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:07:25,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:07:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:07:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:07:25,504 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:07:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:07:25,532 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-09-13 00:07:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:07:25,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-13 00:07:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:07:25,540 INFO L225 Difference]: With dead ends: 58 [2024-09-13 00:07:25,540 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 00:07:25,543 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:07:25,546 INFO L434 NwaCegarLoop]: 36 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, 36 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:07:25,547 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:07:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 00:07:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 00:07:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 00:07:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-13 00:07:25,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-09-13 00:07:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:07:25,617 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-13 00:07:25,618 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:07:25,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:07:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-13 00:07:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 00:07:25,622 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:07:25,626 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:07:25,627 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:07:25,627 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:07:25,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:07:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-09-13 00:07:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:07:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716473191] [2024-09-13 00:07:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:07:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:07:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:07:25,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498138082] [2024-09-13 00:07:25,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:07:25,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:07:25,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:07:25,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:07:25,720 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 00:07:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:25,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 00:07:25,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:07:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 00:07:26,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:07:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:07:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:07:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716473191] [2024-09-13 00:07:26,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:07:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498138082] [2024-09-13 00:07:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498138082] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 00:07:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:07:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-09-13 00:07:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021685167] [2024-09-13 00:07:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:07:26,212 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 00:07:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:07:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 00:07:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-13 00:07:26,214 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:07:30,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-09-13 00:07:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:07:30,396 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-09-13 00:07:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 00:07:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-09-13 00:07:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:07:30,398 INFO L225 Difference]: With dead ends: 38 [2024-09-13 00:07:30,399 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 00:07:30,399 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-13 00:07:30,401 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:07:30,402 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-09-13 00:07:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 00:07:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-13 00:07:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:07:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-13 00:07:30,415 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2024-09-13 00:07:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:07:30,416 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-13 00:07:30,416 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:07:30,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:07:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-13 00:07:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-13 00:07:30,418 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:07:30,418 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:07:30,436 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 00:07:30,623 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:07:30,624 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:07:30,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:07:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-09-13 00:07:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:07:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339455882] [2024-09-13 00:07:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:07:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:07:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:07:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:07:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:07:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:07:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:07:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 00:07:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:07:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:07:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339455882] [2024-09-13 00:07:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339455882] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:07:31,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:07:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 00:07:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650585811] [2024-09-13 00:07:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:07:31,321 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 00:07:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:07:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 00:07:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:07:31,322 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 00:07:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:07:31,375 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-09-13 00:07:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 00:07:31,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-09-13 00:07:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:07:31,377 INFO L225 Difference]: With dead ends: 51 [2024-09-13 00:07:31,377 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 00:07:31,378 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:07:31,380 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:07:31,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:07:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 00:07:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-13 00:07:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:07:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-13 00:07:31,398 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-09-13 00:07:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:07:31,399 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-13 00:07:31,400 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 00:07:31,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:07:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-13 00:07:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 00:07:31,402 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:07:31,402 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:07:31,403 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 00:07:31,403 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:07:31,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:07:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-09-13 00:07:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:07:31,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007526115] [2024-09-13 00:07:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:07:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:07:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:07:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738299421] [2024-09-13 00:07:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:07:31,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:07:31,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:07:31,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:07:31,452 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 00:07:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:07:31,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 00:07:31,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:07:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-13 00:07:31,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:08:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:08:10,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007526115] [2024-09-13 00:08:10,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:08:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738299421] [2024-09-13 00:08:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738299421] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:08:10,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:08:10,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-09-13 00:08:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613017120] [2024-09-13 00:08:10,529 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 00:08:10,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 00:08:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:08:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 00:08:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=190, Unknown=9, NotChecked=0, Total=240 [2024-09-13 00:08:10,532 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 00:08:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:08:10,845 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-13 00:08:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 00:08:10,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-09-13 00:08:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:08:10,848 INFO L225 Difference]: With dead ends: 52 [2024-09-13 00:08:10,848 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 00:08:10,849 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=47, Invalid=216, Unknown=9, NotChecked=0, Total=272 [2024-09-13 00:08:10,851 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:08:10,851 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 159 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 00:08:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 00:08:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-09-13 00:08:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:08:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-13 00:08:10,867 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 44 [2024-09-13 00:08:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:08:10,868 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-13 00:08:10,869 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 00:08:10,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-13 00:08:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-13 00:08:10,872 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:08:10,872 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:08:10,880 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 00:08:11,073 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:11,074 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:08:11,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-09-13 00:08:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:08:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444886674] [2024-09-13 00:08:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:08:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:08:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:08:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:08:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:08:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:08:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 00:08:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 00:08:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 00:08:11,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:08:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444886674] [2024-09-13 00:08:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444886674] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:08:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245284938] [2024-09-13 00:08:11,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 00:08:11,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:08:11,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:08:11,645 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 00:08:11,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 00:08:11,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:08:11,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 00:08:11,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:08:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:08:12,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:08:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:08:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245284938] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:08:13,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:08:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2024-09-13 00:08:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894085035] [2024-09-13 00:08:13,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:08:13,193 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 00:08:13,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:08:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 00:08:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-09-13 00:08:13,194 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 00:08:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:08:14,507 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-09-13 00:08:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 00:08:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) Word has length 52 [2024-09-13 00:08:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:08:14,511 INFO L225 Difference]: With dead ends: 86 [2024-09-13 00:08:14,512 INFO L226 Difference]: Without dead ends: 54 [2024-09-13 00:08:14,513 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-09-13 00:08:14,514 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:08:14,515 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-13 00:08:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-13 00:08:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-09-13 00:08:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:08:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-09-13 00:08:14,535 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2024-09-13 00:08:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:08:14,537 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-09-13 00:08:14,537 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 00:08:14,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-09-13 00:08:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 00:08:14,539 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:08:14,539 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:08:14,548 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 00:08:14,739 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:14,740 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:08:14,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-09-13 00:08:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:08:14,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307212659] [2024-09-13 00:08:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:08:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:08:14,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984189455] [2024-09-13 00:08:14,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 00:08:14,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:14,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:08:14,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:08:14,873 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 00:08:15,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 00:08:15,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:08:15,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-13 00:08:15,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:08:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 00:08:17,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:09:55,152 WARN L293 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2024-09-13 00:10:15,236 WARN L293 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:10:35,292 WARN L293 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:10:52,730 WARN L293 SmtUtils]: Spent 17.44s on a formula simplification. DAG size of input: 21 DAG size of output: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:11:12,829 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:12:33,107 WARN L293 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2024-09-13 00:12:53,165 WARN L293 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:13:13,219 WARN L293 SmtUtils]: Spent 20.05s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:13:33,301 WARN L293 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:13:49,384 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:13:53,405 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_main_~b~0 1073741824))) (let ((.cse2 (* .cse10 4))) (or (let ((.cse7 (* c_main_~b~0 c_main_~q~0))) (let ((.cse9 (mod .cse7 1073741824))) (let ((.cse1 (mod c_main_~A~0 4294967296)) (.cse0 (* 4 .cse9))) (let ((.cse5 (+ .cse0 (mod c_main_~b~0 4294967296))) (.cse6 (* .cse10 2)) (.cse4 (= .cse1 (mod (+ (* 4294967292 .cse9) c_main_~A~0 (* .cse10 c_main_~q~0 4)) 4294967296))) (.cse3 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 1)) (< (+ (* 4294967296 (div (+ .cse2 .cse3 .cse0 (- 4294967297)) 4294967296)) .cse1 4294967296) .cse0) .cse4 (< (+ .cse1 (* (div (+ (- 1) .cse3 .cse0) 4294967296) 4294967296) 4294967296) .cse5) (< (+ .cse1 (* (div (+ (* c_main_~b~0 c_main_~q~0 4) (- 1) .cse3) 4294967296) 4294967296) 4294967296) (+ .cse6 (* 4 .cse7)))) (let ((.cse8 (+ .cse1 (* (div (+ .cse3 4294967295 .cse0) 4294967296) 4294967296)))) (or (< (+ .cse1 (* (div (+ (- 1) .cse2 .cse3 .cse0) 4294967296) 4294967296)) .cse0) (< .cse8 .cse5) (< .cse8 (+ .cse6 .cse0)) .cse4))))))) (= .cse2 (mod c_main_~B~0 4294967296))))) is different from true [2024-09-13 00:14:09,499 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:14:33,617 WARN L293 SmtUtils]: Spent 20.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:14:53,684 WARN L293 SmtUtils]: Spent 20.07s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:15:13,744 WARN L293 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:15:21,778 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (* c_main_~b~0 c_main_~q~0) 1073741824)) (.cse0 (mod c_main_~A~0 4294967296))) (let ((.cse2 (* (- 1) .cse0)) (.cse3 (* 4 .cse6)) (.cse5 (mod c_main_~b~0 1073741824))) (let ((.cse1 (* .cse5 4)) (.cse4 (+ .cse0 (* (div (+ .cse2 4294967295 .cse3) 4294967296) 4294967296)))) (or (< (+ .cse0 (* (div (+ (- 1) .cse1 .cse2 .cse3) 4294967296) 4294967296)) .cse3) (< .cse4 (+ .cse3 (mod c_main_~b~0 4294967296))) (= .cse1 (mod c_main_~B~0 4294967296)) (< .cse4 (+ (* .cse5 2) .cse3)) (= .cse0 (mod (+ (* 4294967292 .cse6) c_main_~A~0 (* .cse5 c_main_~q~0 4)) 4294967296)))))) is different from true [2024-09-13 00:15:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 4 not checked. [2024-09-13 00:15:21,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:15:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307212659] [2024-09-13 00:15:21,852 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:15:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984189455] [2024-09-13 00:15:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984189455] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:15:21,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:15:21,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2024-09-13 00:15:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094557968] [2024-09-13 00:15:21,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:15:21,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 00:15:21,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:15:21,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 00:15:21,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=642, Unknown=3, NotChecked=106, Total=870 [2024-09-13 00:15:21,855 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 25 states have internal predecessors, (49), 9 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-13 00:15:25,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:15:59,758 WARN L293 SmtUtils]: Spent 29.73s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:16:04,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:16:08,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:16:13,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:16:19,790 WARN L293 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:16:24,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:16:31,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:16:50,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:16:56,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:09,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:13,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:18,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:22,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:30,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:50,192 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:17:54,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:59,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:18:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:19:00,397 WARN L293 SmtUtils]: Spent 25.06s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:19:02,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:20:34,467 WARN L293 SmtUtils]: Spent 53.71s on a formula simplification. DAG size of input: 50 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:20:38,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:20:47,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:20:50,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:20:54,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:20:59,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:20:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:20:59,167 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2024-09-13 00:20:59,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-13 00:20:59,171 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 25 states have internal predecessors, (49), 9 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 54 [2024-09-13 00:20:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:20:59,174 INFO L225 Difference]: With dead ends: 127 [2024-09-13 00:20:59,174 INFO L226 Difference]: Without dead ends: 121 [2024-09-13 00:20:59,175 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 272.2s TimeCoverageRelationStatistics Valid=507, Invalid=2558, Unknown=23, NotChecked=218, Total=3306 [2024-09-13 00:20:59,176 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 130 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 69 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 88.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:20:59,176 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 336 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 480 Invalid, 15 Unknown, 256 Unchecked, 88.0s Time] [2024-09-13 00:20:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-09-13 00:20:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2024-09-13 00:20:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 73 states have internal predecessors, (78), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (19), 12 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-13 00:20:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2024-09-13 00:20:59,242 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 54 [2024-09-13 00:20:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:20:59,243 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2024-09-13 00:20:59,243 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 25 states have internal predecessors, (49), 9 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-13 00:20:59,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:20:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2024-09-13 00:20:59,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-13 00:20:59,245 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:20:59,245 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:20:59,256 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 00:20:59,445 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:20:59,446 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:20:59,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:20:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash 205266060, now seen corresponding path program 4 times [2024-09-13 00:20:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:20:59,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726012239] [2024-09-13 00:20:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:20:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:21:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:21:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:21:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:21:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:21:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:21:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 00:21:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 00:21:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:21:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 26 proven. 23 refuted. 2 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:21:32,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:21:32,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726012239] [2024-09-13 00:21:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726012239] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:21:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552014236] [2024-09-13 00:21:32,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 00:21:32,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:21:32,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:21:32,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:21:32,645 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 00:21:32,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 00:21:32,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:21:32,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-13 00:21:32,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... Killed by 15