./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64261cdf4de80f70fe2d4ad7338f6b0821a851ad9c048667535af1ece80ec49c --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:50:36,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:50:37,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:50:37,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:50:37,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:50:37,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:50:37,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:50:37,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:50:37,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:50:37,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:50:37,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:50:37,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:50:37,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:50:37,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:50:37,044 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:50:37,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:50:37,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:50:37,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:50:37,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:50:37,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:50:37,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:50:37,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:50:37,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:50:37,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:50:37,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:50:37,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:50:37,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:50:37,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:50:37,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:50:37,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:50:37,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:50:37,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:50:37,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:50:37,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:50:37,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:50:37,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:50:37,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:50:37,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:50:37,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:50:37,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:50:37,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:50:37,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:50:37,054 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 -> 64261cdf4de80f70fe2d4ad7338f6b0821a851ad9c048667535af1ece80ec49c Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:50:37,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:50:37,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:50:37,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:50:37,310 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:50:37,311 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:50:37,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c [2024-09-24 23:50:38,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:50:38,841 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:50:38,841 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c [2024-09-24 23:50:38,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ba6487515/f4fd8422072442eaad09236798c090cb/FLAG7f9306e8a [2024-09-24 23:50:39,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ba6487515/f4fd8422072442eaad09236798c090cb [2024-09-24 23:50:39,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:50:39,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:50:39,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:50:39,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:50:39,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:50:39,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b822da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39, skipping insertion in model container [2024-09-24 23:50:39,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:50:39,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2024-09-24 23:50:39,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:50:39,471 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:50:39,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2024-09-24 23:50:39,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:50:39,504 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:50:39,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39 WrapperNode [2024-09-24 23:50:39,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:50:39,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:50:39,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:50:39,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:50:39,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,522 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:50:39,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:50:39,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:50:39,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:50:39,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:50:39,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,551 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-24 23:50:39,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:50:39,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:50:39,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:50:39,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:50:39,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (1/1) ... [2024-09-24 23:50:39,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:50:39,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:50:39,595 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-24 23:50:39,600 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-24 23:50:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:50:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:50:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:50:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:50:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:50:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:50:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:50:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:50:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:50:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:50:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:50:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:50:39,692 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:50:39,694 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:50:39,860 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:50:39,861 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:50:39,887 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:50:39,888 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:50:39,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:50:39 BoogieIcfgContainer [2024-09-24 23:50:39,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:50:39,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:50:39,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:50:39,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:50:39,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:50:39" (1/3) ... [2024-09-24 23:50:39,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9a3fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:50:39, skipping insertion in model container [2024-09-24 23:50:39,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:50:39" (2/3) ... [2024-09-24 23:50:39,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9a3fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:50:39, skipping insertion in model container [2024-09-24 23:50:39,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:50:39" (3/3) ... [2024-09-24 23:50:39,897 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound50.c [2024-09-24 23:50:39,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:50:39,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:50:39,956 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:50:39,961 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;@4df21070, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:50:39,962 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:50:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-24 23:50:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-24 23:50:39,972 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:39,972 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:39,973 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:39,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-24 23:50:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503920343] [2024-09-24 23:50:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:50:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:50:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:50:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:50:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:50:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:50:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503920343] [2024-09-24 23:50:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503920343] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:50:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:50:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:50:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125489865] [2024-09-24 23:50:40,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:50:40,175 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:50:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:50:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:50:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:50:40,193 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-24 23:50:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:50:40,219 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-24 23:50:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:50:40,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-24 23:50:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:50:40,230 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:50:40,230 INFO L226 Difference]: Without dead ends: 32 [2024-09-24 23:50:40,233 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:50:40,236 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:50:40,236 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:50:40,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-24 23:50:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-24 23:50:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:50:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-24 23:50:40,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-24 23:50:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:50:40,274 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-24 23:50:40,275 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-24 23:50:40,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-24 23:50:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-24 23:50:40,277 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:40,279 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:40,279 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:50:40,280 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:40,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-24 23:50:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136552693] [2024-09-24 23:50:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:50:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:50:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:50:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:50:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:50:40,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:50:40,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136552693] [2024-09-24 23:50:40,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136552693] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:50:40,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:50:40,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:50:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788889721] [2024-09-24 23:50:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:50:40,639 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:50:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:50:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:50:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:50:40,642 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-24 23:50:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:50:40,722 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-24 23:50:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:50:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-24 23:50:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:50:40,726 INFO L225 Difference]: With dead ends: 45 [2024-09-24 23:50:40,726 INFO L226 Difference]: Without dead ends: 43 [2024-09-24 23:50:40,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:50:40,730 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:50:40,731 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:50:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-24 23:50:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-24 23:50:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:50:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-24 23:50:40,749 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-24 23:50:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:50:40,749 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-24 23:50:40,749 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-24 23:50:40,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-24 23:50:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:50:40,752 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:40,752 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:40,753 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:50:40,754 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:40,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-24 23:50:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:40,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967751340] [2024-09-24 23:50:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:41,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:50:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:41,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:50:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:41,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:50:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:41,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:50:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:41,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:50:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:50:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:50:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967751340] [2024-09-24 23:50:41,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967751340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:50:41,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:50:41,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:50:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811616811] [2024-09-24 23:50:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:50:41,140 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:50:41,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:50:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:50:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:50:41,142 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:50:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:50:41,272 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-24 23:50:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:50:41,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-24 23:50:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:50:41,274 INFO L225 Difference]: With dead ends: 49 [2024-09-24 23:50:41,274 INFO L226 Difference]: Without dead ends: 47 [2024-09-24 23:50:41,274 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:50:41,275 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:50:41,275 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:50:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-24 23:50:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-24 23:50:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:50:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-24 23:50:41,291 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-24 23:50:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:50:41,291 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-24 23:50:41,292 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:50:41,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-24 23:50:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-24 23:50:41,294 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:41,294 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:41,294 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:50:41,295 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:41,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-24 23:50:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642013113] [2024-09-24 23:50:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:50:41,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811101312] [2024-09-24 23:50:41,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:41,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:41,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:50:41,337 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-24 23:50:41,338 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-24 23:50:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:41,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-24 23:50:41,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:50:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-24 23:50:41,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:50:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:50:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642013113] [2024-09-24 23:50:41,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:50:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811101312] [2024-09-24 23:50:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811101312] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:50:41,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:50:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-24 23:50:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775141235] [2024-09-24 23:50:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:50:41,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 23:50:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:50:41,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 23:50:41,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:50:41,600 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:50:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:50:41,872 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-24 23:50:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 23:50:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-09-24 23:50:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:50:41,874 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:50:41,874 INFO L226 Difference]: Without dead ends: 53 [2024-09-24 23:50:41,874 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:50:41,875 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:50:41,876 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:50:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-24 23:50:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-24 23:50:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-24 23:50:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-24 23:50:41,900 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-24 23:50:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:50:41,900 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-24 23:50:41,900 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:50:41,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-24 23:50:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-24 23:50:41,902 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:41,902 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:41,919 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-24 23:50:42,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:42,103 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:42,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-24 23:50:42,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:42,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97915848] [2024-09-24 23:50:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:50:42,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648156269] [2024-09-24 23:50:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:42,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:42,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:50:42,145 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-24 23:50:42,146 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-24 23:50:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:42,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-24 23:50:42,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:50:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:50:42,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:50:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-24 23:50:43,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:50:43,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97915848] [2024-09-24 23:50:43,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:50:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648156269] [2024-09-24 23:50:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648156269] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:50:43,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:50:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-24 23:50:43,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624170324] [2024-09-24 23:50:43,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:50:43,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-24 23:50:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:50:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-24 23:50:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-24 23:50:43,418 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-24 23:50:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:50:44,203 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-24 23:50:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 23:50:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 44 [2024-09-24 23:50:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:50:44,206 INFO L225 Difference]: With dead ends: 71 [2024-09-24 23:50:44,206 INFO L226 Difference]: Without dead ends: 63 [2024-09-24 23:50:44,206 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-24 23:50:44,207 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-24 23:50:44,208 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-24 23:50:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-24 23:50:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-24 23:50:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-24 23:50:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-09-24 23:50:44,222 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2024-09-24 23:50:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:50:44,223 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-09-24 23:50:44,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-24 23:50:44,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-09-24 23:50:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-24 23:50:44,224 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:44,225 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:44,241 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-24 23:50:44,428 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:44,429 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:44,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-24 23:50:44,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672423112] [2024-09-24 23:50:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:50:44,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197254714] [2024-09-24 23:50:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:44,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:50:44,474 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-24 23:50:44,476 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-24 23:50:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:44,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 23:50:44,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:50:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-24 23:50:44,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:50:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-24 23:50:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:50:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672423112] [2024-09-24 23:50:44,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:50:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197254714] [2024-09-24 23:50:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197254714] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-24 23:50:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:50:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-09-24 23:50:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439924812] [2024-09-24 23:50:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:50:44,805 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:50:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:50:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:50:44,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:50:44,806 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-24 23:50:47,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:50:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:50:47,186 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-09-24 23:50:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:50:47,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2024-09-24 23:50:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:50:47,188 INFO L225 Difference]: With dead ends: 73 [2024-09-24 23:50:47,188 INFO L226 Difference]: Without dead ends: 71 [2024-09-24 23:50:47,189 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:50:47,189 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-09-24 23:50:47,190 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-09-24 23:50:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-24 23:50:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-24 23:50:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-24 23:50:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-09-24 23:50:47,220 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 54 [2024-09-24 23:50:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:50:47,220 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-09-24 23:50:47,221 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-24 23:50:47,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-09-24 23:50:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-24 23:50:47,225 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:47,226 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:47,233 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-24 23:50:47,429 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-24 23:50:47,430 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:47,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash -752924724, now seen corresponding path program 1 times [2024-09-24 23:50:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415500257] [2024-09-24 23:50:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:50:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:50:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:50:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:50:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:50:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:50:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:50:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:50:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-24 23:50:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-24 23:50:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-24 23:50:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-24 23:50:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-24 23:50:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:50:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415500257] [2024-09-24 23:50:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415500257] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:50:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962503663] [2024-09-24 23:50:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:47,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:47,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:50:47,556 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-24 23:50:47,559 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-24 23:50:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:47,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-24 23:50:47,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:50:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-24 23:50:47,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:50:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962503663] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:50:47,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:50:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2024-09-24 23:50:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099783926] [2024-09-24 23:50:47,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:50:47,794 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 23:50:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:50:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 23:50:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:50:47,795 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-24 23:50:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:50:48,038 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-09-24 23:50:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 23:50:48,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 72 [2024-09-24 23:50:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:50:48,040 INFO L225 Difference]: With dead ends: 102 [2024-09-24 23:50:48,040 INFO L226 Difference]: Without dead ends: 94 [2024-09-24 23:50:48,040 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-24 23:50:48,041 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:50:48,041 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 232 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:50:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-24 23:50:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-09-24 23:50:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-24 23:50:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-24 23:50:48,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 72 [2024-09-24 23:50:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:50:48,063 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-24 23:50:48,063 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-24 23:50:48,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-24 23:50:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-24 23:50:48,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:50:48,065 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:50:48,077 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-24 23:50:48,266 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:48,266 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:50:48,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:50:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-24 23:50:48,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:50:48,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227145236] [2024-09-24 23:50:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:50:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:50:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740888778] [2024-09-24 23:50:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:50:48,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:50:48,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:50:48,304 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-24 23:50:48,305 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-24 23:50:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:50:48,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-24 23:50:48,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:50:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 54 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-24 23:50:49,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:51:16,069 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-24 23:51:28,281 WARN L293 SmtUtils]: Spent 8.01s 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-24 23:51:44,296 WARN L293 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:51:56,333 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse3 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< (mod c_main_~r~0 4294967296) .cse3) (= .cse4 1) (= .cse0 (mod (+ (* 4294967295 .cse3) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2))) 4294967296))))) is different from true [2024-09-24 23:52:05,537 WARN L293 SmtUtils]: Spent 8.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-24 23:52:13,898 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:52:26,348 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:52:42,368 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:52:50,383 WARN L293 SmtUtils]: Spent 8.01s 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-24 23:52:58,431 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:53:07,806 WARN L293 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:53:23,828 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-24 23:53:27,833 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse4 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse5 (mod c_main_~p~0 4294967296)) (.cse3 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< .cse3 .cse4) (= .cse5 1) (= .cse0 (mod (+ (* 4294967295 .cse4) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse5 2))) 4294967296)) (< .cse2 (+ 1 .cse3))))) is different from true [2024-09-24 23:53:48,150 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:54:08,197 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:54:17,795 WARN L293 SmtUtils]: Spent 5.97s 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-24 23:54:34,510 WARN L293 SmtUtils]: Spent 12.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:54:41,952 WARN L293 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:54:53,268 WARN L293 SmtUtils]: Spent 11.32s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:55:09,289 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-24 23:55:13,295 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse4 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse5 (mod c_main_~p~0 4294967296)) (.cse3 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (not (= .cse0 .cse3)) (< .cse3 .cse4) (= .cse5 1) (= .cse0 (mod (+ (* 4294967295 .cse4) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse5 2))) 4294967296)) (< .cse2 (+ 1 .cse3))))) is different from true