./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7a9d89991bb39658ba66b50d9cb80ba7d1aa37f87b1a2f7972fc25c15a1ea38 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 00:18:19,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:18:19,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:18:19,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:18:19,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:18:19,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:18:19,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:18:19,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:18:19,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:18:19,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:18:19,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:18:19,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:18:19,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:18:19,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:18:19,653 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:18:19,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:18:19,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:18:19,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:18:19,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:18:19,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:18:19,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:18:19,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:18:19,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:18:19,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:18:19,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:18:19,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:18:19,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:18:19,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:18:19,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:18:19,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:18:19,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:18:19,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:18:19,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:18:19,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:18:19,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:18:19,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:18:19,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:18:19,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:18:19,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:18:19,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:18:19,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:18:19,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:18:19,666 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 -> c7a9d89991bb39658ba66b50d9cb80ba7d1aa37f87b1a2f7972fc25c15a1ea38 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 00:18:19,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:18:19,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:18:19,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:18:19,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:18:19,943 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:18:19,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i [2024-09-13 00:18:21,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:18:21,621 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:18:21,621 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i [2024-09-13 00:18:21,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c8478777d/62900a2da2974ca2bbe3fcfd05264d5e/FLAG75981aa6d [2024-09-13 00:18:21,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c8478777d/62900a2da2974ca2bbe3fcfd05264d5e [2024-09-13 00:18:21,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:18:21,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:18:21,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:18:21,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:18:21,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:18:21,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79261738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21, skipping insertion in model container [2024-09-13 00:18:21,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:18:21,840 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i[950,963] [2024-09-13 00:18:21,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:18:21,868 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:18:21,881 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i[950,963] [2024-09-13 00:18:21,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:18:21,912 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:18:21,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21 WrapperNode [2024-09-13 00:18:21,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:18:21,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:18:21,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:18:21,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:18:21,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,961 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:18:21,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:18:21,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:18:21,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:18:21,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:18:21,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,983 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 00:18:21,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:21,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:18:21,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:18:21,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:18:21,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:18:21,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (1/1) ... [2024-09-13 00:18:22,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:18:22,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:18:22,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 00:18:22,037 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 00:18:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:18:22,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:18:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:18:22,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:18:22,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:18:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:18:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:18:22,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:18:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:18:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:18:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:18:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:18:22,163 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:18:22,166 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:18:22,319 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 00:18:22,319 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:18:22,339 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:18:22,339 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 00:18:22,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:18:22 BoogieIcfgContainer [2024-09-13 00:18:22,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:18:22,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:18:22,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:18:22,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:18:22,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:18:21" (1/3) ... [2024-09-13 00:18:22,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921a59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:18:22, skipping insertion in model container [2024-09-13 00:18:22,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:18:21" (2/3) ... [2024-09-13 00:18:22,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921a59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:18:22, skipping insertion in model container [2024-09-13 00:18:22,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:18:22" (3/3) ... [2024-09-13 00:18:22,350 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound50.i [2024-09-13 00:18:22,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:18:22,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:18:22,421 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:18:22,432 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39227afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:18:22,433 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:18:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 00:18:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-13 00:18:22,451 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:18:22,452 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:18:22,453 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:18:22,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-09-13 00:18:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:18:22,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321124892] [2024-09-13 00:18:22,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:18:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:22,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:18:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:22,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:18:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:22,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:18:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:22,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:18:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:22,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:18:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:18:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:18:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321124892] [2024-09-13 00:18:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321124892] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:18:22,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:18:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:18:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672342468] [2024-09-13 00:18:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:18:22,705 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:18:22,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:18:22,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:18:22,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:18:22,732 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:18:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:18:22,766 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-09-13 00:18:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:18:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-13 00:18:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:18:22,776 INFO L225 Difference]: With dead ends: 58 [2024-09-13 00:18:22,776 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 00:18:22,779 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:18:22,782 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:18:22,783 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:18:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 00:18:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 00:18:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 00:18:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-13 00:18:22,822 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-09-13 00:18:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:18:22,822 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-13 00:18:22,823 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:18:22,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-13 00:18:22,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 00:18:22,825 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:18:22,826 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:18:22,826 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:18:22,826 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:18:22,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:22,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-09-13 00:18:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:18:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974027457] [2024-09-13 00:18:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:22,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:18:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:18:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652452425] [2024-09-13 00:18:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:22,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:18:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:18:22,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:18:22,909 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 00:18:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:22,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 00:18:23,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:18:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 00:18:23,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:18:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:18:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:18:23,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974027457] [2024-09-13 00:18:23,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:18:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652452425] [2024-09-13 00:18:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652452425] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 00:18:23,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:18:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-09-13 00:18:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058421179] [2024-09-13 00:18:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:18:23,433 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 00:18:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:18:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 00:18:23,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-13 00:18:23,436 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:18:27,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-09-13 00:18:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:18:27,534 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-09-13 00:18:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 00:18:27,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-09-13 00:18:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:18:27,536 INFO L225 Difference]: With dead ends: 38 [2024-09-13 00:18:27,536 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 00:18:27,536 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-13 00:18:27,538 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-13 00:18:27,538 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-09-13 00:18:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 00:18:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-13 00:18:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:18:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-13 00:18:27,562 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2024-09-13 00:18:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:18:27,563 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-13 00:18:27,563 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:18:27,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-13 00:18:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-13 00:18:27,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:18:27,565 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:18:27,581 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 00:18:27,767 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:18:27,767 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:18:27,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:27,768 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-09-13 00:18:27,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:18:27,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611813177] [2024-09-13 00:18:27,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:27,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:18:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:18:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:18:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:18:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:18:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:18:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,502 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 00:18:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:18:28,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:18:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611813177] [2024-09-13 00:18:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611813177] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:18:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:18:28,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 00:18:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238005751] [2024-09-13 00:18:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:18:28,520 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 00:18:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:18:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 00:18:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:18:28,522 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 00:18:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:18:28,576 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-09-13 00:18:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 00:18:28,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-09-13 00:18:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:18:28,578 INFO L225 Difference]: With dead ends: 51 [2024-09-13 00:18:28,578 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 00:18:28,578 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:18:28,579 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:18:28,579 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:18:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 00:18:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-13 00:18:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:18:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-13 00:18:28,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-09-13 00:18:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:18:28,595 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-13 00:18:28,595 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 00:18:28,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-13 00:18:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 00:18:28,597 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:18:28,597 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:18:28,597 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 00:18:28,597 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:18:28,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-09-13 00:18:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:18:28,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416668497] [2024-09-13 00:18:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:18:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:18:28,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362262686] [2024-09-13 00:18:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:28,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:18:28,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:18:28,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:18:28,634 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 00:18:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:28,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 00:18:28,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:18:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-13 00:18:28,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:19:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:19:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416668497] [2024-09-13 00:19:08,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:19:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362262686] [2024-09-13 00:19:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362262686] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:19:08,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:19:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-09-13 00:19:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410860388] [2024-09-13 00:19:08,985 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 00:19:08,985 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 00:19:08,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:19:08,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 00:19:08,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=191, Unknown=8, NotChecked=0, Total=240 [2024-09-13 00:19:08,988 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 00:19:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:19:09,281 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-13 00:19:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 00:19:09,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-09-13 00:19:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:19:09,283 INFO L225 Difference]: With dead ends: 52 [2024-09-13 00:19:09,285 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 00:19:09,286 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=47, Invalid=217, Unknown=8, NotChecked=0, Total=272 [2024-09-13 00:19:09,287 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:19:09,287 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 159 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 00:19:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 00:19:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-09-13 00:19:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:19:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-13 00:19:09,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 44 [2024-09-13 00:19:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:19:09,306 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-13 00:19:09,307 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 00:19:09,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:19:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-13 00:19:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-13 00:19:09,310 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:19:09,310 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:19:09,320 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 00:19:09,510 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:19:09,511 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:19:09,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:19:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-09-13 00:19:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:19:09,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677083410] [2024-09-13 00:19:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:19:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:19:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:19:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:19:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:19:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:19:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:19:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,038 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 00:19:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 00:19:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:19:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 00:19:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:19:10,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677083410] [2024-09-13 00:19:10,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677083410] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:19:10,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146076409] [2024-09-13 00:19:10,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 00:19:10,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:19:10,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:19:10,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:19:10,060 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 00:19:10,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 00:19:10,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:19:10,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 00:19:10,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:19:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:19:10,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:19:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:19:11,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146076409] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:19:11,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:19:11,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2024-09-13 00:19:11,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585249467] [2024-09-13 00:19:11,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:19:11,463 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 00:19:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:19:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 00:19:11,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-09-13 00:19:11,464 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 00:19:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:19:12,909 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-09-13 00:19:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 00:19:12,910 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) Word has length 52 [2024-09-13 00:19:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:19:12,913 INFO L225 Difference]: With dead ends: 86 [2024-09-13 00:19:12,913 INFO L226 Difference]: Without dead ends: 54 [2024-09-13 00:19:12,914 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-09-13 00:19:12,915 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:19:12,916 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-13 00:19:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-13 00:19:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-09-13 00:19:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:19:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-09-13 00:19:12,933 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2024-09-13 00:19:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:19:12,934 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-09-13 00:19:12,934 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 00:19:12,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:19:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-09-13 00:19:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 00:19:12,936 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:19:12,936 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:19:12,945 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 00:19:13,140 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:19:13,141 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:19:13,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:19:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-09-13 00:19:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:19:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012177319] [2024-09-13 00:19:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:19:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:19:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:19:13,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717053122] [2024-09-13 00:19:13,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 00:19:13,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:19:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:19:13,285 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:19:13,290 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 00:19:13,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 00:19:13,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:19:13,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-13 00:19:13,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:19:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-13 00:19:14,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:19:49,080 WARN L293 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:20:05,130 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:20:21,190 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:20:45,293 WARN L293 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:20:49,310 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 1073741824))) (let ((.cse3 (mod c_main_~A~0 4294967296)) (.cse2 (mod c_main_~r~0 4294967296)) (.cse0 (* .cse1 2))) (or (= .cse0 (mod c_main_~B~0 4294967296)) (< (* .cse1 4) (+ 1 .cse2)) (< .cse2 (mod c_main_~b~0 4294967296)) (not (= (mod (+ (* c_main_~b~0 c_main_~q~0 4) c_main_~r~0) 4294967296) .cse3)) (= .cse3 (mod (+ (* .cse1 c_main_~q~0 4) c_main_~r~0) 4294967296)) (< .cse2 .cse0)))) is different from true [2024-09-13 00:21:05,365 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:21:21,422 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:21:37,485 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:22:01,565 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:22:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 4 not checked. [2024-09-13 00:22:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:22:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012177319] [2024-09-13 00:22:01,613 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:22:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717053122] [2024-09-13 00:22:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717053122] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:22:01,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:22:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 27 [2024-09-13 00:22:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490949038] [2024-09-13 00:22:01,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:22:01,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 00:22:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:22:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 00:22:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=537, Unknown=1, NotChecked=48, Total=702 [2024-09-13 00:22:01,616 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-13 00:22:03,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:22:43,612 WARN L293 SmtUtils]: Spent 34.08s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:22:47,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:22:51,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:03,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:07,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:14,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:20,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:24,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:34,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:39,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:46,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:24:52,098 WARN L293 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 69 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:24:53,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-13 00:24:57,423 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 [0] [2024-09-13 00:25:02,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:04,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:20,110 WARN L293 SmtUtils]: Spent 10.69s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:25:22,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:24,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:28,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:49,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:26:03,540 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:26:04,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:26:14,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:26:18,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:26:22,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:26:40,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-13 00:26:46,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:27,830 WARN L293 SmtUtils]: Spent 29.26s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:27:31,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:35,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:37,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:41,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:45,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:49,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:53,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:27:57,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:02,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:10,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:14,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:19,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:23,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:28,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:28:28,265 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2024-09-13 00:28:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-13 00:28:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 54 [2024-09-13 00:28:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:28:28,270 INFO L225 Difference]: With dead ends: 121 [2024-09-13 00:28:28,270 INFO L226 Difference]: Without dead ends: 116 [2024-09-13 00:28:28,271 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 245.0s TimeCoverageRelationStatistics Valid=381, Invalid=1413, Unknown=16, NotChecked=82, Total=1892 [2024-09-13 00:28:28,272 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 36 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 157.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 157.6s IncrementalHoareTripleChecker+Time [2024-09-13 00:28:28,272 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 440 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 569 Invalid, 30 Unknown, 121 Unchecked, 157.6s Time] [2024-09-13 00:28:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-13 00:28:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2024-09-13 00:28:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 00:28:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2024-09-13 00:28:28,336 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 54 [2024-09-13 00:28:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:28:28,336 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2024-09-13 00:28:28,336 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-13 00:28:28,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:28:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2024-09-13 00:28:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-13 00:28:28,338 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:28:28,338 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:28:28,346 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 00:28:28,539 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:28:28,539 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:28:28,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:28:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash 205266060, now seen corresponding path program 4 times [2024-09-13 00:28:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:28:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930354772] [2024-09-13 00:28:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:28:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:28:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:28:47,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1966775883] [2024-09-13 00:28:47,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 00:28:47,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:28:47,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:28:47,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:28:47,147 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 00:28:47,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 00:28:47,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:28:47,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-13 00:28:47,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:29:22,582 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:29:34,595 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:29:51,321 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:30:21,116 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:30:33,128 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:30:38,490 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:30:50,502 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:31:06,551 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:31:18,568 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:31:34,821 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:31:45,097 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:32:01,328 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:32:13,350 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:32:29,485 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:32:48,988 WARN L293 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15