./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/hard-u_valuebound5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 904eff5ab9a028829a49b56a519e098f085128eb26f428782b06e9247ecafe60 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:54:24,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:54:24,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:54:24,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:54:24,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:54:24,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:54:24,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:54:24,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:54:24,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:54:24,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:54:24,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:54:24,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:54:24,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:54:24,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:54:24,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:54:24,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:54:24,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:54:24,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:54:24,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:54:24,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:54:24,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:54:24,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:54:24,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:54:24,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:54:24,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:54:24,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:54:24,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:54:24,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:54:24,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:54:24,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:54:24,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:54:24,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:54:24,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:54:24,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:54:24,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:54:24,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:54:24,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:54:24,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:54:24,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:54:24,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:54:24,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:54:24,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:54:24,149 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 -> 904eff5ab9a028829a49b56a519e098f085128eb26f428782b06e9247ecafe60 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:54:24,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:54:24,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:54:24,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:54:24,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:54:24,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:54:24,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound5.c [2024-10-15 14:54:25,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:54:25,695 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:54:25,696 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound5.c [2024-10-15 14:54:25,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/547707127/b954082b6d2c45759a3b943d9065ffef/FLAGefdec0890 [2024-10-15 14:54:25,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/547707127/b954082b6d2c45759a3b943d9065ffef [2024-10-15 14:54:25,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:54:25,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:54:25,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:54:25,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:54:25,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:54:25,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8784b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25, skipping insertion in model container [2024-10-15 14:54:25,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:54:25,874 WARN L248 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/hard-u_valuebound5.c[537,550] [2024-10-15 14:54:25,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:54:25,901 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:54:25,910 WARN L248 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/hard-u_valuebound5.c[537,550] [2024-10-15 14:54:25,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:54:25,931 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:54:25,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25 WrapperNode [2024-10-15 14:54:25,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:54:25,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:54:25,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:54:25,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:54:25,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,948 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:54:25,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:54:25,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:54:25,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:54:25,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:54:25,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,969 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-10-15 14:54:25,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:54:25,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:54:25,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:54:25,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:54:25,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (1/1) ... [2024-10-15 14:54:25,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:54:26,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:54:26,011 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-10-15 14:54:26,012 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-10-15 14:54:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:54:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:54:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:54:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:54:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:54:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:54:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:54:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:54:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:54:26,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:54:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:54:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:54:26,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:54:26,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:54:26,280 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:54:26,281 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:54:26,301 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:54:26,303 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:54:26,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:54:26 BoogieIcfgContainer [2024-10-15 14:54:26,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:54:26,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:54:26,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:54:26,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:54:26,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:54:25" (1/3) ... [2024-10-15 14:54:26,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc585f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:54:26, skipping insertion in model container [2024-10-15 14:54:26,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:54:25" (2/3) ... [2024-10-15 14:54:26,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc585f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:54:26, skipping insertion in model container [2024-10-15 14:54:26,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:54:26" (3/3) ... [2024-10-15 14:54:26,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound5.c [2024-10-15 14:54:26,332 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:54:26,332 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:54:26,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:54:26,374 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@153bb39c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:54:26,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:54:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:54:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:54:26,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:26,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:54:26,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:26,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-10-15 14:54:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:26,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923068261] [2024-10-15 14:54:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:54:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:54:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:54:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:54:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:54:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:26,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923068261] [2024-10-15 14:54:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923068261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:54:26,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:54:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:54:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781767645] [2024-10-15 14:54:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:54:26,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:54:26,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:54:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:54:26,541 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:54:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:26,567 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-10-15 14:54:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:54:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-15 14:54:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:26,575 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:54:26,575 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 14:54:26,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-10-15 14:54:26,580 INFO L432 NwaCegarLoop]: 44 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, 44 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-10-15 14:54:26,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:54:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 14:54:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 14:54:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:54:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-15 14:54:26,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-10-15 14:54:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:26,645 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-15 14:54:26,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:54:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-15 14:54:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:54:26,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:26,647 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:54:26,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:54:26,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-10-15 14:54:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749488580] [2024-10-15 14:54:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:54:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:54:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:54:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:54:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:54:26,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749488580] [2024-10-15 14:54:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749488580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:54:26,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:54:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:54:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088368097] [2024-10-15 14:54:26,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:54:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:54:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:54:26,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:54:26,874 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 14:54:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:26,944 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-15 14:54:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:54:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-10-15 14:54:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:26,946 INFO L225 Difference]: With dead ends: 45 [2024-10-15 14:54:26,946 INFO L226 Difference]: Without dead ends: 43 [2024-10-15 14:54:26,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:54:26,948 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:26,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:54:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-15 14:54:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-10-15 14:54:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:54:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-15 14:54:26,959 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-10-15 14:54:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:26,960 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-15 14:54:26,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 14:54:26,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-15 14:54:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 14:54:26,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:26,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:54:26,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:54:26,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:26,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-10-15 14:54:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939869727] [2024-10-15 14:54:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:54:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:27,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:54:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:54:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:54:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:54:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:54:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939869727] [2024-10-15 14:54:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939869727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:54:27,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:54:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:54:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012020147] [2024-10-15 14:54:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:54:27,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:54:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:27,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:54:27,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:54:27,277 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:54:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:27,378 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-10-15 14:54:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:54:27,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-10-15 14:54:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:27,379 INFO L225 Difference]: With dead ends: 49 [2024-10-15 14:54:27,379 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 14:54:27,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:54:27,380 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:27,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:54:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 14:54:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-10-15 14:54:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:54:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-15 14:54:27,394 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-10-15 14:54:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:27,394 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-15 14:54:27,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:54:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-15 14:54:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-15 14:54:27,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:27,396 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:54:27,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:54:27,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:27,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:27,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-10-15 14:54:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:27,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987451502] [2024-10-15 14:54:27,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:27,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:54:27,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116276667] [2024-10-15 14:54:27,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:27,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:27,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:54:27,441 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-10-15 14:54:27,442 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:54:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:27,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 14:54:27,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:54:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 14:54:27,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:54:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987451502] [2024-10-15 14:54:27,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:54:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116276667] [2024-10-15 14:54:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116276667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:54:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:54:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-15 14:54:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119645420] [2024-10-15 14:54:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:54:27,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:54:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:27,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:54:27,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:54:27,685 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:54:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:27,891 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-10-15 14:54:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:54:27,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-10-15 14:54:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:27,892 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:54:27,892 INFO L226 Difference]: Without dead ends: 53 [2024-10-15 14:54:27,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:54:27,893 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:27,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:54:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-15 14:54:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-15 14:54:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-15 14:54:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-10-15 14:54:27,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-10-15 14:54:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:27,914 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-10-15 14:54:27,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:54:27,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-10-15 14:54:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:54:27,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:27,916 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 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-10-15 14:54:27,930 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:54:28,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:28,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:28,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-10-15 14:54:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:28,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617980097] [2024-10-15 14:54:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:54:28,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822186167] [2024-10-15 14:54:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:28,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:28,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:54:28,146 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-10-15 14:54:28,149 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:54:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:28,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 14:54:28,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:54:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:54:28,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:54:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:54:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617980097] [2024-10-15 14:54:29,280 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:54:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822186167] [2024-10-15 14:54:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822186167] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:54:29,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:54:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-10-15 14:54:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311796625] [2024-10-15 14:54:29,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:54:29,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-15 14:54:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 14:54:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-15 14:54:29,284 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-15 14:54:33,634 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-10-15 14:54:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:34,422 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-10-15 14:54:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:54:34,422 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 44 [2024-10-15 14:54:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:34,424 INFO L225 Difference]: With dead ends: 71 [2024-10-15 14:54:34,424 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 14:54:34,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:54:34,425 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:34,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 218 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-10-15 14:54:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 14:54:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-15 14:54:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-15 14:54:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-10-15 14:54:34,435 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2024-10-15 14:54:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:34,435 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-10-15 14:54:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-15 14:54:34,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-10-15 14:54:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:54:34,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:34,437 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 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] [2024-10-15 14:54:34,449 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:54:34,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:34,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:34,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-10-15 14:54:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:34,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172548285] [2024-10-15 14:54:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:54:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229716736] [2024-10-15 14:54:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:54:34,662 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-10-15 14:54:34,663 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:54:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:34,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:54:34,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:54:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-15 14:54:34,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:54:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-15 14:54:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:34,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172548285] [2024-10-15 14:54:34,951 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:54:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229716736] [2024-10-15 14:54:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229716736] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:54:34,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:54:34,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-10-15 14:54:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016031575] [2024-10-15 14:54:34,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:54:34,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:54:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:54:34,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:54:34,952 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-15 14:54:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:35,232 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-10-15 14:54:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:54:35,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2024-10-15 14:54:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:35,233 INFO L225 Difference]: With dead ends: 73 [2024-10-15 14:54:35,233 INFO L226 Difference]: Without dead ends: 71 [2024-10-15 14:54:35,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:54:35,234 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:35,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:54:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-15 14:54:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-15 14:54:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-15 14:54:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-10-15 14:54:35,249 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 54 [2024-10-15 14:54:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:35,249 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-10-15 14:54:35,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-15 14:54:35,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-10-15 14:54:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-15 14:54:35,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:35,252 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2024-10-15 14:54:35,262 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:54:35,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 14:54:35,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:35,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash -752924724, now seen corresponding path program 1 times [2024-10-15 14:54:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:35,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895380209] [2024-10-15 14:54:35,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:54:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:54:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:54:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:54:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:54:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:54:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:54:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:54:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:54:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:54:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:54:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:54:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-15 14:54:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:54:35,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895380209] [2024-10-15 14:54:35,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895380209] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:54:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969790830] [2024-10-15 14:54:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:35,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:35,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:54:35,579 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-10-15 14:54:35,580 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:54:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:35,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 14:54:35,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:54:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-15 14:54:35,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:54:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969790830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:54:35,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:54:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2024-10-15 14:54:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899917645] [2024-10-15 14:54:35,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:54:35,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:54:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:54:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:54:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:54:35,779 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-15 14:54:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:54:35,991 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-10-15 14:54:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:54:35,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 72 [2024-10-15 14:54:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:54:35,993 INFO L225 Difference]: With dead ends: 102 [2024-10-15 14:54:35,994 INFO L226 Difference]: Without dead ends: 94 [2024-10-15 14:54:35,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-15 14:54:35,995 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:54:35,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 232 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:54:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-15 14:54:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-15 14:54:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-15 14:54:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-10-15 14:54:36,014 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 72 [2024-10-15 14:54:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:54:36,015 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-10-15 14:54:36,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-15 14:54:36,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-10-15 14:54:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-15 14:54:36,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:54:36,016 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1] [2024-10-15 14:54:36,028 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 14:54:36,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:36,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:54:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:54:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-10-15 14:54:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:54:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439321103] [2024-10-15 14:54:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:54:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:54:36,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403402224] [2024-10-15 14:54:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:54:36,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:54:36,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:54:36,271 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-10-15 14:54:36,273 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:54:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:54:36,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-15 14:54:37,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:54:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 54 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-15 14:54:37,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:55:21,894 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:55:37,914 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:55:42,003 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse3 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< (mod c_main_~r~0 4294967296) .cse3) (= .cse4 1) (= .cse0 (mod (+ (* 4294967295 .cse3) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2))) 4294967296))))) is different from true [2024-10-15 14:55:50,447 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:56:06,465 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:56:31,269 WARN L286 SmtUtils]: Spent 12.64s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:56:39,281 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:56:55,307 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:57:19,342 WARN L286 SmtUtils]: Spent 24.03s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:57:35,366 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:57:39,383 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse4 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse5 (mod c_main_~p~0 4294967296)) (.cse3 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< .cse3 .cse4) (= .cse5 1) (= .cse0 (mod (+ (* 4294967295 .cse4) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse5 2))) 4294967296)) (< .cse2 (+ 1 .cse3))))) is different from true [2024-10-15 14:57:44,459 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:58:03,858 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:58:23,895 WARN L286 SmtUtils]: Spent 20.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:58:39,926 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:59:00,013 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)