./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i --full-output --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 a9b967e5 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_valuebound100.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 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d --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-a9b967e-m [2024-09-11 19:49:45,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:49:45,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:49:45,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:49:45,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:49:45,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:49:45,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:49:45,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:49:45,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:49:45,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:49:45,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:49:45,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:49:45,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:49:45,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:49:45,280 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:49:45,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:49:45,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:49:45,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:49:45,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:49:45,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:49:45,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:49:45,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:49:45,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:49:45,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:49:45,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:49:45,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:49:45,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:49:45,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:49:45,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:49:45,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:49:45,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:49:45,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:49:45,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:49:45,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:49:45,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:49:45,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:49:45,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:49:45,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:49:45,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:49:45,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:49:45,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:49:45,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:49:45,287 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 -> 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d 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-11 19:49:45,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:49:45,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:49:45,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:49:45,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:49:45,497 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:49:45,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2024-09-11 19:49:46,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:49:46,893 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:49:46,894 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2024-09-11 19:49:46,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7035972a7/6a9f8cf89b194127ad7b554e62c099f6/FLAGa2ea0b7ad [2024-09-11 19:49:47,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7035972a7/6a9f8cf89b194127ad7b554e62c099f6 [2024-09-11 19:49:47,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:49:47,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:49:47,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:49:47,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:49:47,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:49:47,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d752593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47, skipping insertion in model container [2024-09-11 19:49:47,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:49:47,453 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_valuebound100.i[950,963] [2024-09-11 19:49:47,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:49:47,474 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:49:47,485 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_valuebound100.i[950,963] [2024-09-11 19:49:47,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:49:47,509 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:49:47,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47 WrapperNode [2024-09-11 19:49:47,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:49:47,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:49:47,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:49:47,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:49:47,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,540 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-09-11 19:49:47,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:49:47,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:49:47,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:49:47,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:49:47,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,560 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-11 19:49:47,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:49:47,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:49:47,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:49:47,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:49:47,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (1/1) ... [2024-09-11 19:49:47,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:49:47,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:47,598 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-11 19:49:47,599 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-11 19:49:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:49:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:49:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:49:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:49:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:49:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:49:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:49:47,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:49:47,678 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:49:47,679 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:49:47,775 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 19:49:47,775 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:49:47,788 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:49:47,789 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:49:47,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:49:47 BoogieIcfgContainer [2024-09-11 19:49:47,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:49:47,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:49:47,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:49:47,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:49:47,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:49:47" (1/3) ... [2024-09-11 19:49:47,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b70d930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:49:47, skipping insertion in model container [2024-09-11 19:49:47,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:47" (2/3) ... [2024-09-11 19:49:47,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b70d930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:49:47, skipping insertion in model container [2024-09-11 19:49:47,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:49:47" (3/3) ... [2024-09-11 19:49:47,795 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.i [2024-09-11 19:49:47,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:49:47,807 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:49:47,850 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:49:47,855 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;@62290289, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:49:47,855 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:49:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:49:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-11 19:49:47,863 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:47,864 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] [2024-09-11 19:49:47,864 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:47,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1335240993, now seen corresponding path program 1 times [2024-09-11 19:49:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043575349] [2024-09-11 19:49:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:48,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:49:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:48,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:49:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:48,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:49:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:48,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:49:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:48,083 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-11 19:49:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043575349] [2024-09-11 19:49:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043575349] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:49:48,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461481629] [2024-09-11 19:49:48,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:48,101 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:49:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:49:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:49:48,126 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:49:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:48,152 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2024-09-11 19:49:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:49:48,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-11 19:49:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:48,158 INFO L225 Difference]: With dead ends: 50 [2024-09-11 19:49:48,158 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 19:49:48,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-11 19:49:48,163 INFO L434 NwaCegarLoop]: 30 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, 30 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-11 19:49:48,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:49:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 19:49:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-11 19:49:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:49:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-09-11 19:49:48,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2024-09-11 19:49:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:48,190 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-09-11 19:49:48,190 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:49:48,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-09-11 19:49:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:49:48,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:48,191 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] [2024-09-11 19:49:48,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:49:48,192 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:48,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1249624970, now seen corresponding path program 1 times [2024-09-11 19:49:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816742025] [2024-09-11 19:49:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:49:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339902403] [2024-09-11 19:49:48,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:48,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:48,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:48,247 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-11 19:49:48,248 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-11 19:49:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:48,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:49:48,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:48,513 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-11 19:49:48,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:49:48,638 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-11 19:49:48,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:48,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816742025] [2024-09-11 19:49:48,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:49:48,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339902403] [2024-09-11 19:49:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339902403] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 19:49:48,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:49:48,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-09-11 19:49:48,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140756630] [2024-09-11 19:49:48,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:48,643 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:49:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:49:48,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:49:48,646 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:49:52,723 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-11 19:49:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:52,741 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-09-11 19:49:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:49:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-11 19:49:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:52,742 INFO L225 Difference]: With dead ends: 34 [2024-09-11 19:49:52,742 INFO L226 Difference]: Without dead ends: 31 [2024-09-11 19:49:52,743 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 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-11 19:49:52,744 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:52,744 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2024-09-11 19:49:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-11 19:49:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-11 19:49:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:49:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-09-11 19:49:52,752 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 30 [2024-09-11 19:49:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:52,753 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-09-11 19:49:52,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:49:52,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-09-11 19:49:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:49:52,754 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:52,755 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] [2024-09-11 19:49:52,767 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-11 19:49:52,959 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-11 19:49:52,959 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:52,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash -158878427, now seen corresponding path program 1 times [2024-09-11 19:49:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083453615] [2024-09-11 19:49:52,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:53,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:49:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:53,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:49:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:53,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:49:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:53,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:49:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:53,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 19:49:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:53,411 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-11 19:49:53,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:53,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083453615] [2024-09-11 19:49:53,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083453615] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:53,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:49:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035865417] [2024-09-11 19:49:53,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:53,414 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:49:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:49:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:49:53,416 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:49:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:53,442 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-09-11 19:49:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:49:53,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-09-11 19:49:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:53,444 INFO L225 Difference]: With dead ends: 47 [2024-09-11 19:49:53,444 INFO L226 Difference]: Without dead ends: 33 [2024-09-11 19:49:53,444 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-11 19:49:53,445 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:53,445 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:49:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-11 19:49:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-11 19:49:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:49:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-09-11 19:49:53,454 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 38 [2024-09-11 19:49:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:53,454 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-09-11 19:49:53,455 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:49:53,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-09-11 19:49:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 19:49:53,456 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:53,456 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] [2024-09-11 19:49:53,457 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:49:53,457 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:53,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash 599091488, now seen corresponding path program 1 times [2024-09-11 19:49:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875048790] [2024-09-11 19:49:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:49:53,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410680052] [2024-09-11 19:49:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:53,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:53,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:53,497 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-11 19:49:53,498 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-11 19:49:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:53,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 19:49:53,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 19:49:53,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:49:53,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:53,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875048790] [2024-09-11 19:49:53,945 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:49:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410680052] [2024-09-11 19:49:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410680052] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:49:53,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:49:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-09-11 19:49:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242904115] [2024-09-11 19:49:53,945 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 19:49:53,945 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:49:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:53,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:49:53,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:49:53,946 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 19:49:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:54,062 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-09-11 19:49:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:49:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2024-09-11 19:49:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:54,064 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:49:54,064 INFO L226 Difference]: Without dead ends: 44 [2024-09-11 19:49:54,064 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:49:54,065 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:54,065 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 129 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:49:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-11 19:49:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-09-11 19:49:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:49:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-09-11 19:49:54,073 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 40 [2024-09-11 19:49:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:54,074 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-09-11 19:49:54,074 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 19:49:54,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-09-11 19:49:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-11 19:49:54,075 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:54,075 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] [2024-09-11 19:49:54,082 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:49:54,275 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-11 19:49:54,276 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:54,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2107284293, now seen corresponding path program 2 times [2024-09-11 19:49:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763206361] [2024-09-11 19:49:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:54,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:49:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:54,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:49:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:54,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:49:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:54,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:49:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:54,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:49:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:54,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:49:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:54,615 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-11 19:49:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763206361] [2024-09-11 19:49:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763206361] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:49:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935527024] [2024-09-11 19:49:54,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:49:54,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:54,617 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-11 19:49:54,618 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-11 19:49:54,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:49:54,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:49:54,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-11 19:49:54,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:55,389 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-11 19:49:55,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:49:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 19:49:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935527024] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:49:55,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:49:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 21 [2024-09-11 19:49:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118623806] [2024-09-11 19:49:55,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:49:55,803 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 19:49:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 19:49:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-09-11 19:49:55,812 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-11 19:49:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:56,254 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2024-09-11 19:49:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:49:56,255 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 48 [2024-09-11 19:49:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:56,257 INFO L225 Difference]: With dead ends: 79 [2024-09-11 19:49:56,257 INFO L226 Difference]: Without dead ends: 50 [2024-09-11 19:49:56,257 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:49:56,258 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:56,258 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 208 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:49:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-11 19:49:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-09-11 19:49:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:49:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-11 19:49:56,270 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 48 [2024-09-11 19:49:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:56,270 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-11 19:49:56,270 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-11 19:49:56,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-11 19:49:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 19:49:56,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:56,272 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] [2024-09-11 19:49:56,284 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:49:56,472 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-11 19:49:56,472 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:56,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1064658186, now seen corresponding path program 3 times [2024-09-11 19:49:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:56,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893876594] [2024-09-11 19:49:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:49:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660877412] [2024-09-11 19:49:56,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:49:56,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:56,571 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-11 19:49:56,572 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-11 19:49:57,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 19:49:57,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:49:57,033 WARN L260 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-11 19:49:57,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 19:49:58,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:51,223 WARN L293 SmtUtils]: Spent 16.03s 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-11 19:51:11,336 WARN L293 SmtUtils]: Spent 16.03s 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-11 19:51:27,369 WARN L293 SmtUtils]: Spent 16.03s 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-11 19:51:47,425 WARN L293 SmtUtils]: Spent 16.03s 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-11 19:52:03,458 WARN L293 SmtUtils]: Spent 16.03s 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-11 19:52:07,471 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~b~0#1| 1073741824))) (let ((.cse3 (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse4 (* .cse1 4)) (.cse2 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296))) (or (= .cse0 (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* .cse1 4 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296)) (< .cse2 (mod |c_ULTIMATE.start_main_~b~0#1| 4294967296)) (= .cse3 (* 2 .cse1)) (= .cse4 .cse3) (not (= (mod (+ (* |c_ULTIMATE.start_main_~b~0#1| 4 |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) .cse0)) (< .cse4 (+ .cse2 1)) (< .cse2 (* 2 (mod |c_ULTIMATE.start_main_~b~0#1| 2147483648)))))) is different from true [2024-09-11 19:52:23,519 WARN L293 SmtUtils]: Spent 16.04s 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-11 19:52:43,583 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-11 19:52:59,642 WARN L293 SmtUtils]: Spent 16.06s 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-11 19:53:19,693 WARN L293 SmtUtils]: Spent 16.04s 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-11 19:53:35,743 WARN L293 SmtUtils]: Spent 16.05s 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-11 19:53:35,778 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-11 19:53:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:53:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893876594] [2024-09-11 19:53:35,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:53:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660877412] [2024-09-11 19:53:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660877412] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:53:35,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:53:35,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 28 [2024-09-11 19:53:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440671122] [2024-09-11 19:53:35,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:53:35,780 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-11 19:53:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:53:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-11 19:53:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=571, Unknown=5, NotChecked=50, Total=756 [2024-09-11 19:53:35,781 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-11 19:53:38,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:53:40,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:54:08,543 WARN L293 SmtUtils]: Spent 25.46s on a formula simplification. DAG size of input: 69 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:54:12,637 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-11 19:54:16,645 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 []