./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.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 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:18:31,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:18:31,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:18:31,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:18:31,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:18:31,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:18:31,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:18:31,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:18:31,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:18:31,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:18:31,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:18:31,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:18:31,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:18:31,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:18:31,653 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:18:31,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:18:31,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:18:31,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:18:31,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:18:31,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:18:31,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:18:31,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:18:31,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:18:31,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:18:31,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:18:31,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:18:31,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:18:31,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:18:31,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:18:31,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:18:31,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:18:31,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:18:31,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:18:31,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:18:31,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:18:31,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:18:31,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:18:31,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:18:31,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:18:31,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:18:31,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:18:31,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:18:31,671 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 -> 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:18:31,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:18:31,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:18:31,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:18:31,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:18:31,936 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:18:31,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-10-15 14:18:33,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:18:33,618 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:18:33,619 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-10-15 14:18:33,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a936e0087/4bae777c9df04bf0a0de0d88735144dc/FLAG4d51301d2 [2024-10-15 14:18:33,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a936e0087/4bae777c9df04bf0a0de0d88735144dc [2024-10-15 14:18:33,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:18:33,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:18:33,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:18:33,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:18:33,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:18:33,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:18:33" (1/1) ... [2024-10-15 14:18:33,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7930c032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:33, skipping insertion in model container [2024-10-15 14:18:33,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:18:33" (1/1) ... [2024-10-15 14:18:33,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:18:33,913 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/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2024-10-15 14:18:33,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:18:33,995 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:18:34,028 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/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2024-10-15 14:18:34,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:18:34,098 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:18:34,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34 WrapperNode [2024-10-15 14:18:34,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:18:34,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:18:34,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:18:34,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:18:34,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,128 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:18:34,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:18:34,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:18:34,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:18:34,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:18:34,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,156 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:18:34,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:18:34,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:18:34,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:18:34,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:18:34,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (1/1) ... [2024-10-15 14:18:34,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:18:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:18:34,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:18:34,238 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:18:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:18:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:18:34,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:18:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:18:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:18:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:18:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:18:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:18:34,357 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:18:34,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:18:34,938 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-15 14:18:34,938 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:18:34,973 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:18:34,973 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 14:18:34,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:18:34 BoogieIcfgContainer [2024-10-15 14:18:34,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:18:35,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:18:35,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:18:35,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:18:35,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:18:33" (1/3) ... [2024-10-15 14:18:35,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a078f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:18:35, skipping insertion in model container [2024-10-15 14:18:35,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:34" (2/3) ... [2024-10-15 14:18:35,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a078f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:18:35, skipping insertion in model container [2024-10-15 14:18:35,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:18:34" (3/3) ... [2024-10-15 14:18:35,014 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2024-10-15 14:18:35,032 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:18:35,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:18:35,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:18:35,109 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37f16a84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:18:35,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:18:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:18:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:35,127 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:35,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1593263039, now seen corresponding path program 1 times [2024-10-15 14:18:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:35,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496746722] [2024-10-15 14:18:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:35,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:35,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496746722] [2024-10-15 14:18:35,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496746722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:35,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:18:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625743093] [2024-10-15 14:18:35,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:35,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:18:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:35,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:18:35,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:18:35,749 INFO L87 Difference]: Start difference. First operand has 148 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:36,387 INFO L93 Difference]: Finished difference Result 291 states and 561 transitions. [2024-10-15 14:18:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 14:18:36,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:36,400 INFO L225 Difference]: With dead ends: 291 [2024-10-15 14:18:36,400 INFO L226 Difference]: Without dead ends: 144 [2024-10-15 14:18:36,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:18:36,411 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 274 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:36,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 11 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-15 14:18:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-15 14:18:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-10-15 14:18:36,477 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 142 [2024-10-15 14:18:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:36,479 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-10-15 14:18:36,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:36,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-10-15 14:18:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:36,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:36,484 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:36,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:18:36,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash -693514170, now seen corresponding path program 1 times [2024-10-15 14:18:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26013483] [2024-10-15 14:18:36,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:36,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26013483] [2024-10-15 14:18:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26013483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:36,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:18:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455480692] [2024-10-15 14:18:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:18:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:36,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:18:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:18:36,718 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:37,334 INFO L93 Difference]: Finished difference Result 409 states and 608 transitions. [2024-10-15 14:18:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 14:18:37,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:37,338 INFO L225 Difference]: With dead ends: 409 [2024-10-15 14:18:37,339 INFO L226 Difference]: Without dead ends: 276 [2024-10-15 14:18:37,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:18:37,344 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 399 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:37,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 7 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-15 14:18:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-15 14:18:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 272 states have (on average 1.2536764705882353) internal successors, (341), 272 states have internal predecessors, (341), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 344 transitions. [2024-10-15 14:18:37,400 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 344 transitions. Word has length 142 [2024-10-15 14:18:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:37,400 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 344 transitions. [2024-10-15 14:18:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:37,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 344 transitions. [2024-10-15 14:18:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:37,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:37,404 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:37,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:18:37,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:37,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -304606969, now seen corresponding path program 1 times [2024-10-15 14:18:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:37,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970578528] [2024-10-15 14:18:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:37,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:37,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970578528] [2024-10-15 14:18:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970578528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:37,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:37,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:18:37,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772281926] [2024-10-15 14:18:37,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:37,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:18:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:37,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:18:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:18:37,656 INFO L87 Difference]: Start difference. First operand 276 states and 344 transitions. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 7 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:38,188 INFO L93 Difference]: Finished difference Result 403 states and 471 transitions. [2024-10-15 14:18:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:18:38,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 7 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:38,190 INFO L225 Difference]: With dead ends: 403 [2024-10-15 14:18:38,191 INFO L226 Difference]: Without dead ends: 268 [2024-10-15 14:18:38,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:18:38,192 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 203 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:38,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 13 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:18:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-15 14:18:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-10-15 14:18:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.246212121212121) internal successors, (329), 264 states have internal predecessors, (329), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 332 transitions. [2024-10-15 14:18:38,222 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 332 transitions. Word has length 142 [2024-10-15 14:18:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:38,222 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 332 transitions. [2024-10-15 14:18:38,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 7 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:38,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 332 transitions. [2024-10-15 14:18:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:38,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:38,225 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:38,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:18:38,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:38,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:38,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1846341478, now seen corresponding path program 1 times [2024-10-15 14:18:38,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:38,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650594609] [2024-10-15 14:18:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650594609] [2024-10-15 14:18:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650594609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-15 14:18:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95290863] [2024-10-15 14:18:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:38,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:18:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:38,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:18:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:18:38,437 INFO L87 Difference]: Start difference. First operand 268 states and 332 transitions. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:38,904 INFO L93 Difference]: Finished difference Result 393 states and 457 transitions. [2024-10-15 14:18:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:18:38,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:38,906 INFO L225 Difference]: With dead ends: 393 [2024-10-15 14:18:38,906 INFO L226 Difference]: Without dead ends: 266 [2024-10-15 14:18:38,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:18:38,911 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 202 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:38,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 10 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:18:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-15 14:18:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-10-15 14:18:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 262 states have (on average 1.2442748091603053) internal successors, (326), 262 states have internal predecessors, (326), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 329 transitions. [2024-10-15 14:18:38,945 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 329 transitions. Word has length 142 [2024-10-15 14:18:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:38,945 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 329 transitions. [2024-10-15 14:18:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 329 transitions. [2024-10-15 14:18:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:38,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:38,948 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:38,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:18:38,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:38,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash -465074757, now seen corresponding path program 1 times [2024-10-15 14:18:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906463914] [2024-10-15 14:18:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906463914] [2024-10-15 14:18:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906463914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-15 14:18:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311728429] [2024-10-15 14:18:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:39,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:18:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:18:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:18:39,141 INFO L87 Difference]: Start difference. First operand 266 states and 329 transitions. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:39,742 INFO L93 Difference]: Finished difference Result 389 states and 452 transitions. [2024-10-15 14:18:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 14:18:39,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:39,745 INFO L225 Difference]: With dead ends: 389 [2024-10-15 14:18:39,745 INFO L226 Difference]: Without dead ends: 264 [2024-10-15 14:18:39,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2024-10-15 14:18:39,748 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 201 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:39,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 13 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-15 14:18:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-15 14:18:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 260 states have (on average 1.2423076923076923) internal successors, (323), 260 states have internal predecessors, (323), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2024-10-15 14:18:39,779 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 142 [2024-10-15 14:18:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:39,779 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2024-10-15 14:18:39,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:39,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2024-10-15 14:18:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:39,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:39,782 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:39,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:18:39,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:39,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash 890455678, now seen corresponding path program 1 times [2024-10-15 14:18:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164129984] [2024-10-15 14:18:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164129984] [2024-10-15 14:18:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164129984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:40,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-15 14:18:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842414926] [2024-10-15 14:18:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:40,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 14:18:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 14:18:40,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:18:40,034 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 12 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:40,591 INFO L93 Difference]: Finished difference Result 381 states and 443 transitions. [2024-10-15 14:18:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:18:40,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 12 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:40,593 INFO L225 Difference]: With dead ends: 381 [2024-10-15 14:18:40,593 INFO L226 Difference]: Without dead ends: 258 [2024-10-15 14:18:40,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2024-10-15 14:18:40,594 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 198 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:40,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 13 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:18:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-15 14:18:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-15 14:18:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 254 states have (on average 1.236220472440945) internal successors, (314), 254 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 317 transitions. [2024-10-15 14:18:40,613 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 317 transitions. Word has length 142 [2024-10-15 14:18:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:40,613 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 317 transitions. [2024-10-15 14:18:40,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 12 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:40,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 317 transitions. [2024-10-15 14:18:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:40,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:40,615 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:40,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:18:40,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -150385202, now seen corresponding path program 1 times [2024-10-15 14:18:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476823800] [2024-10-15 14:18:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:40,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476823800] [2024-10-15 14:18:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476823800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:40,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:40,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-15 14:18:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102685847] [2024-10-15 14:18:40,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:40,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:18:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:40,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:18:40,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:18:40,874 INFO L87 Difference]: Start difference. First operand 258 states and 317 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 14 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:41,544 INFO L93 Difference]: Finished difference Result 371 states and 430 transitions. [2024-10-15 14:18:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 14:18:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 14 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:41,546 INFO L225 Difference]: With dead ends: 371 [2024-10-15 14:18:41,546 INFO L226 Difference]: Without dead ends: 254 [2024-10-15 14:18:41,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2024-10-15 14:18:41,547 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:41,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 16 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-15 14:18:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-10-15 14:18:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.232) internal successors, (308), 250 states have internal predecessors, (308), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 311 transitions. [2024-10-15 14:18:41,566 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 311 transitions. Word has length 142 [2024-10-15 14:18:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:41,566 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 311 transitions. [2024-10-15 14:18:41,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 14 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:41,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 311 transitions. [2024-10-15 14:18:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:41,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:41,568 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:41,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:18:41,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:41,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -603862297, now seen corresponding path program 1 times [2024-10-15 14:18:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070368397] [2024-10-15 14:18:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:41,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:41,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070368397] [2024-10-15 14:18:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070368397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:41,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:41,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-15 14:18:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25663360] [2024-10-15 14:18:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:41,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 14:18:41,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 14:18:41,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2024-10-15 14:18:41,871 INFO L87 Difference]: Start difference. First operand 254 states and 311 transitions. Second operand has 16 states, 16 states have (on average 8.6875) internal successors, (139), 15 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:42,548 INFO L93 Difference]: Finished difference Result 365 states and 422 transitions. [2024-10-15 14:18:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:18:42,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.6875) internal successors, (139), 15 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:42,550 INFO L225 Difference]: With dead ends: 365 [2024-10-15 14:18:42,550 INFO L226 Difference]: Without dead ends: 252 [2024-10-15 14:18:42,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2024-10-15 14:18:42,552 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 195 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:42,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 16 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-15 14:18:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-10-15 14:18:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 248 states have (on average 1.2298387096774193) internal successors, (305), 248 states have internal predecessors, (305), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 308 transitions. [2024-10-15 14:18:42,568 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 308 transitions. Word has length 142 [2024-10-15 14:18:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:42,568 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 308 transitions. [2024-10-15 14:18:42,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.6875) internal successors, (139), 15 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:42,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2024-10-15 14:18:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:42,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:42,570 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 14:18:42,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:42,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -411238661, now seen corresponding path program 1 times [2024-10-15 14:18:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992741388] [2024-10-15 14:18:42,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:42,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:42,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:42,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992741388] [2024-10-15 14:18:42,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992741388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:42,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:42,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-15 14:18:42,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623318843] [2024-10-15 14:18:42,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:42,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 14:18:42,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:42,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 14:18:42,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:18:42,949 INFO L87 Difference]: Start difference. First operand 252 states and 308 transitions. Second operand has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 17 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:43,622 INFO L93 Difference]: Finished difference Result 359 states and 415 transitions. [2024-10-15 14:18:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 14:18:43,622 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 17 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:43,624 INFO L225 Difference]: With dead ends: 359 [2024-10-15 14:18:43,624 INFO L226 Difference]: Without dead ends: 248 [2024-10-15 14:18:43,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2024-10-15 14:18:43,626 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 193 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:43,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 16 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-15 14:18:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-10-15 14:18:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.2254098360655739) internal successors, (299), 244 states have internal predecessors, (299), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 302 transitions. [2024-10-15 14:18:43,642 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 302 transitions. Word has length 142 [2024-10-15 14:18:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:43,642 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 302 transitions. [2024-10-15 14:18:43,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 17 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 302 transitions. [2024-10-15 14:18:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:43,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:43,644 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:43,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-15 14:18:43,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:43,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1717371161, now seen corresponding path program 1 times [2024-10-15 14:18:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906753575] [2024-10-15 14:18:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:44,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906753575] [2024-10-15 14:18:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906753575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-15 14:18:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194034126] [2024-10-15 14:18:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:44,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:18:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:18:44,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:18:44,026 INFO L87 Difference]: Start difference. First operand 248 states and 302 transitions. Second operand has 20 states, 20 states have (on average 6.95) internal successors, (139), 19 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:44,572 INFO L93 Difference]: Finished difference Result 351 states and 405 transitions. [2024-10-15 14:18:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-15 14:18:44,573 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 19 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:44,575 INFO L225 Difference]: With dead ends: 351 [2024-10-15 14:18:44,575 INFO L226 Difference]: Without dead ends: 244 [2024-10-15 14:18:44,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2024-10-15 14:18:44,576 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:44,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 10 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-15 14:18:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-10-15 14:18:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 240 states have (on average 1.2208333333333334) internal successors, (293), 240 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 296 transitions. [2024-10-15 14:18:44,590 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 296 transitions. Word has length 142 [2024-10-15 14:18:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:44,591 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 296 transitions. [2024-10-15 14:18:44,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 19 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:44,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 296 transitions. [2024-10-15 14:18:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:44,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:44,593 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:44,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-15 14:18:44,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 301646407, now seen corresponding path program 1 times [2024-10-15 14:18:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:44,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741239283] [2024-10-15 14:18:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:44,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:45,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741239283] [2024-10-15 14:18:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741239283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-10-15 14:18:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33176381] [2024-10-15 14:18:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:45,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-15 14:18:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 14:18:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2024-10-15 14:18:45,079 INFO L87 Difference]: Start difference. First operand 244 states and 296 transitions. Second operand has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:45,906 INFO L93 Difference]: Finished difference Result 339 states and 391 transitions. [2024-10-15 14:18:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 14:18:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:45,909 INFO L225 Difference]: With dead ends: 339 [2024-10-15 14:18:45,910 INFO L226 Difference]: Without dead ends: 236 [2024-10-15 14:18:45,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2024-10-15 14:18:45,913 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 187 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:45,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 22 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-15 14:18:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-10-15 14:18:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 232 states have (on average 1.2112068965517242) internal successors, (281), 232 states have internal predecessors, (281), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 284 transitions. [2024-10-15 14:18:45,931 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 284 transitions. Word has length 142 [2024-10-15 14:18:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:45,931 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 284 transitions. [2024-10-15 14:18:45,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2024-10-15 14:18:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:45,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:45,936 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-15 14:18:45,936 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:45,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash -14301178, now seen corresponding path program 1 times [2024-10-15 14:18:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933625725] [2024-10-15 14:18:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933625725] [2024-10-15 14:18:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933625725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:46,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-10-15 14:18:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142576054] [2024-10-15 14:18:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:46,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-15 14:18:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 14:18:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2024-10-15 14:18:46,410 INFO L87 Difference]: Start difference. First operand 236 states and 284 transitions. Second operand has 25 states, 25 states have (on average 5.56) internal successors, (139), 24 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:46,962 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2024-10-15 14:18:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-15 14:18:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 24 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:46,964 INFO L225 Difference]: With dead ends: 329 [2024-10-15 14:18:46,964 INFO L226 Difference]: Without dead ends: 234 [2024-10-15 14:18:46,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2024-10-15 14:18:46,966 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 186 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:46,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 10 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-15 14:18:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-15 14:18:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 230 states have (on average 1.208695652173913) internal successors, (278), 230 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2024-10-15 14:18:46,981 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 142 [2024-10-15 14:18:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:46,981 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2024-10-15 14:18:46,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 24 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2024-10-15 14:18:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:46,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:46,983 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:46,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-15 14:18:46,983 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:46,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1678194107, now seen corresponding path program 1 times [2024-10-15 14:18:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933811245] [2024-10-15 14:18:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933811245] [2024-10-15 14:18:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933811245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-15 14:18:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924827696] [2024-10-15 14:18:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:47,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-15 14:18:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-15 14:18:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2024-10-15 14:18:47,501 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 25 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:48,295 INFO L93 Difference]: Finished difference Result 325 states and 372 transitions. [2024-10-15 14:18:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-15 14:18:48,295 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 25 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:48,297 INFO L225 Difference]: With dead ends: 325 [2024-10-15 14:18:48,299 INFO L226 Difference]: Without dead ends: 232 [2024-10-15 14:18:48,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2024-10-15 14:18:48,301 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 185 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:48,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 22 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:18:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-15 14:18:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-10-15 14:18:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 228 states have (on average 1.206140350877193) internal successors, (275), 228 states have internal predecessors, (275), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 278 transitions. [2024-10-15 14:18:48,318 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 278 transitions. Word has length 142 [2024-10-15 14:18:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:48,319 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 278 transitions. [2024-10-15 14:18:48,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 25 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:48,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 278 transitions. [2024-10-15 14:18:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:48,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:48,320 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:48,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-15 14:18:48,320 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:48,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash 574594206, now seen corresponding path program 1 times [2024-10-15 14:18:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899126378] [2024-10-15 14:18:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:48,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:48,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899126378] [2024-10-15 14:18:48,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899126378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:48,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:48,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-10-15 14:18:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612124602] [2024-10-15 14:18:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:48,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-15 14:18:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:48,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-15 14:18:48,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2024-10-15 14:18:48,890 INFO L87 Difference]: Start difference. First operand 232 states and 278 transitions. Second operand has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:49,604 INFO L93 Difference]: Finished difference Result 317 states and 363 transitions. [2024-10-15 14:18:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-15 14:18:49,604 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:49,606 INFO L225 Difference]: With dead ends: 317 [2024-10-15 14:18:49,606 INFO L226 Difference]: Without dead ends: 226 [2024-10-15 14:18:49,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2024-10-15 14:18:49,608 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 182 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:49,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 16 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-15 14:18:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-10-15 14:18:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 222 states have (on average 1.1981981981981982) internal successors, (266), 222 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 269 transitions. [2024-10-15 14:18:49,622 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 269 transitions. Word has length 142 [2024-10-15 14:18:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:49,622 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 269 transitions. [2024-10-15 14:18:49,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 269 transitions. [2024-10-15 14:18:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:49,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:49,624 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:49,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-15 14:18:49,624 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:49,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1676967250, now seen corresponding path program 1 times [2024-10-15 14:18:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650087124] [2024-10-15 14:18:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:50,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650087124] [2024-10-15 14:18:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650087124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:50,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:50,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2024-10-15 14:18:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089417651] [2024-10-15 14:18:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:50,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-15 14:18:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:50,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-15 14:18:50,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2024-10-15 14:18:50,206 INFO L87 Difference]: Start difference. First operand 226 states and 269 transitions. Second operand has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 30 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:50,816 INFO L93 Difference]: Finished difference Result 307 states and 350 transitions. [2024-10-15 14:18:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-15 14:18:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 30 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:50,818 INFO L225 Difference]: With dead ends: 307 [2024-10-15 14:18:50,818 INFO L226 Difference]: Without dead ends: 222 [2024-10-15 14:18:50,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2024-10-15 14:18:50,820 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 180 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:50,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 7 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:18:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-15 14:18:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-10-15 14:18:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 218 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2024-10-15 14:18:50,837 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 142 [2024-10-15 14:18:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:50,837 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2024-10-15 14:18:50,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 30 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:50,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2024-10-15 14:18:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:50,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:50,839 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:50,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-15 14:18:50,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:50,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash 43579175, now seen corresponding path program 1 times [2024-10-15 14:18:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:50,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483245866] [2024-10-15 14:18:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:51,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:51,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483245866] [2024-10-15 14:18:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483245866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:51,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:51,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2024-10-15 14:18:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234070952] [2024-10-15 14:18:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:51,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-15 14:18:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-15 14:18:51,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2024-10-15 14:18:51,444 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 32 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:52,221 INFO L93 Difference]: Finished difference Result 301 states and 342 transitions. [2024-10-15 14:18:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-15 14:18:52,222 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:52,224 INFO L225 Difference]: With dead ends: 301 [2024-10-15 14:18:52,224 INFO L226 Difference]: Without dead ends: 220 [2024-10-15 14:18:52,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2024-10-15 14:18:52,226 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:52,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 10 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-15 14:18:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-15 14:18:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 216 states have (on average 1.1898148148148149) internal successors, (257), 216 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 260 transitions. [2024-10-15 14:18:52,240 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 260 transitions. Word has length 142 [2024-10-15 14:18:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:52,241 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 260 transitions. [2024-10-15 14:18:52,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 260 transitions. [2024-10-15 14:18:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:52,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:52,242 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:52,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-15 14:18:52,243 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:52,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 356264443, now seen corresponding path program 1 times [2024-10-15 14:18:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62590835] [2024-10-15 14:18:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:52,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:52,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62590835] [2024-10-15 14:18:52,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62590835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:52,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:52,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-10-15 14:18:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398763273] [2024-10-15 14:18:52,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:52,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-15 14:18:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-15 14:18:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2024-10-15 14:18:52,925 INFO L87 Difference]: Start difference. First operand 220 states and 260 transitions. Second operand has 34 states, 34 states have (on average 4.088235294117647) internal successors, (139), 33 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:53,643 INFO L93 Difference]: Finished difference Result 295 states and 335 transitions. [2024-10-15 14:18:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-15 14:18:53,644 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.088235294117647) internal successors, (139), 33 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:53,646 INFO L225 Difference]: With dead ends: 295 [2024-10-15 14:18:53,646 INFO L226 Difference]: Without dead ends: 216 [2024-10-15 14:18:53,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2024-10-15 14:18:53,648 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:53,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 10 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:18:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-15 14:18:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-15 14:18:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 212 states have (on average 1.1839622641509433) internal successors, (251), 212 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2024-10-15 14:18:53,662 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 142 [2024-10-15 14:18:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:53,662 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2024-10-15 14:18:53,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.088235294117647) internal successors, (139), 33 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:53,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2024-10-15 14:18:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:53,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:53,665 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:53,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-15 14:18:53,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:53,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash 538241191, now seen corresponding path program 1 times [2024-10-15 14:18:53,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:53,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587178533] [2024-10-15 14:18:53,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587178533] [2024-10-15 14:18:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587178533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:54,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2024-10-15 14:18:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608840595] [2024-10-15 14:18:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-15 14:18:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-15 14:18:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2024-10-15 14:18:54,392 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 36 states, 36 states have (on average 3.861111111111111) internal successors, (139), 35 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:55,220 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2024-10-15 14:18:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-15 14:18:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.861111111111111) internal successors, (139), 35 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:55,223 INFO L225 Difference]: With dead ends: 287 [2024-10-15 14:18:55,223 INFO L226 Difference]: Without dead ends: 212 [2024-10-15 14:18:55,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2024-10-15 14:18:55,225 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 175 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:55,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 19 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-15 14:18:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-10-15 14:18:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 208 states have (on average 1.1778846153846154) internal successors, (245), 208 states have internal predecessors, (245), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 248 transitions. [2024-10-15 14:18:55,240 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 248 transitions. Word has length 142 [2024-10-15 14:18:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:55,240 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 248 transitions. [2024-10-15 14:18:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.861111111111111) internal successors, (139), 35 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 248 transitions. [2024-10-15 14:18:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:55,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:55,242 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:55,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-15 14:18:55,242 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:55,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1118988679, now seen corresponding path program 1 times [2024-10-15 14:18:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127216797] [2024-10-15 14:18:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:55,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127216797] [2024-10-15 14:18:56,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127216797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:56,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2024-10-15 14:18:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145870024] [2024-10-15 14:18:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:56,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-15 14:18:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-15 14:18:56,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2024-10-15 14:18:56,099 INFO L87 Difference]: Start difference. First operand 212 states and 248 transitions. Second operand has 40 states, 40 states have (on average 3.475) internal successors, (139), 39 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:57,008 INFO L93 Difference]: Finished difference Result 275 states and 311 transitions. [2024-10-15 14:18:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-15 14:18:57,009 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.475) internal successors, (139), 39 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:57,010 INFO L225 Difference]: With dead ends: 275 [2024-10-15 14:18:57,011 INFO L226 Difference]: Without dead ends: 204 [2024-10-15 14:18:57,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2024-10-15 14:18:57,013 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 171 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:57,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 19 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-15 14:18:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-15 14:18:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.165) internal successors, (233), 200 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2024-10-15 14:18:57,026 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 142 [2024-10-15 14:18:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:57,026 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2024-10-15 14:18:57,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.475) internal successors, (139), 39 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:57,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2024-10-15 14:18:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:57,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:57,028 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:57,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-15 14:18:57,028 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -942762330, now seen corresponding path program 1 times [2024-10-15 14:18:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443546836] [2024-10-15 14:18:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:57,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:57,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443546836] [2024-10-15 14:18:57,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443546836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:57,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2024-10-15 14:18:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790774468] [2024-10-15 14:18:57,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:57,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-15 14:18:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:57,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-15 14:18:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2024-10-15 14:18:57,810 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand has 41 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 40 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:58,718 INFO L93 Difference]: Finished difference Result 265 states and 297 transitions. [2024-10-15 14:18:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-15 14:18:58,719 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 40 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:18:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:58,721 INFO L225 Difference]: With dead ends: 265 [2024-10-15 14:18:58,721 INFO L226 Difference]: Without dead ends: 202 [2024-10-15 14:18:58,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2024-10-15 14:18:58,724 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:58,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 7 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:18:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-15 14:18:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-15 14:18:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.1616161616161615) internal successors, (230), 198 states have internal predecessors, (230), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 233 transitions. [2024-10-15 14:18:58,742 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 233 transitions. Word has length 142 [2024-10-15 14:18:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:58,743 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 233 transitions. [2024-10-15 14:18:58,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 40 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:58,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2024-10-15 14:18:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:18:58,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:58,745 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:58,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-15 14:18:58,745 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:58,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash -663626821, now seen corresponding path program 1 times [2024-10-15 14:18:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56347427] [2024-10-15 14:18:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56347427] [2024-10-15 14:18:59,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56347427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2024-10-15 14:18:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699453747] [2024-10-15 14:18:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:59,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-15 14:18:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:59,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-15 14:18:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2024-10-15 14:18:59,713 INFO L87 Difference]: Start difference. First operand 202 states and 233 transitions. Second operand has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 41 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:00,681 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2024-10-15 14:19:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-15 14:19:00,682 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 41 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:00,684 INFO L225 Difference]: With dead ends: 261 [2024-10-15 14:19:00,684 INFO L226 Difference]: Without dead ends: 200 [2024-10-15 14:19:00,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2024-10-15 14:19:00,686 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 169 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:00,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 19 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:19:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-15 14:19:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-10-15 14:19:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 196 states have (on average 1.1581632653061225) internal successors, (227), 196 states have internal predecessors, (227), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2024-10-15 14:19:00,698 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 142 [2024-10-15 14:19:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:00,699 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2024-10-15 14:19:00,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 41 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:00,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2024-10-15 14:19:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:00,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:00,700 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:00,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-15 14:19:00,701 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:00,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1747445950, now seen corresponding path program 1 times [2024-10-15 14:19:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897380613] [2024-10-15 14:19:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:01,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:01,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897380613] [2024-10-15 14:19:01,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897380613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:01,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2024-10-15 14:19:01,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120599853] [2024-10-15 14:19:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:01,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-15 14:19:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:01,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-15 14:19:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2024-10-15 14:19:01,626 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 44 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:02,757 INFO L93 Difference]: Finished difference Result 253 states and 283 transitions. [2024-10-15 14:19:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-15 14:19:02,757 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 44 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:02,759 INFO L225 Difference]: With dead ends: 253 [2024-10-15 14:19:02,759 INFO L226 Difference]: Without dead ends: 194 [2024-10-15 14:19:02,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2024-10-15 14:19:02,761 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 166 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:02,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 25 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:19:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-15 14:19:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-15 14:19:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 190 states have (on average 1.1473684210526316) internal successors, (218), 190 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2024-10-15 14:19:02,775 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 142 [2024-10-15 14:19:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2024-10-15 14:19:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 44 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:02,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2024-10-15 14:19:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:02,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:02,777 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:02,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-15 14:19:02,777 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:02,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1759531634, now seen corresponding path program 1 times [2024-10-15 14:19:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:02,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145141733] [2024-10-15 14:19:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:03,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:03,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:03,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145141733] [2024-10-15 14:19:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145141733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2024-10-15 14:19:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313515475] [2024-10-15 14:19:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:03,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-15 14:19:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-15 14:19:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2024-10-15 14:19:03,778 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:04,918 INFO L93 Difference]: Finished difference Result 243 states and 270 transitions. [2024-10-15 14:19:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-15 14:19:04,919 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:04,920 INFO L225 Difference]: With dead ends: 243 [2024-10-15 14:19:04,920 INFO L226 Difference]: Without dead ends: 190 [2024-10-15 14:19:04,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2024-10-15 14:19:04,922 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 164 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:04,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 16 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:19:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-15 14:19:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-15 14:19:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 186 states have (on average 1.1397849462365592) internal successors, (212), 186 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2024-10-15 14:19:04,937 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 142 [2024-10-15 14:19:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:04,938 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2024-10-15 14:19:04,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:04,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2024-10-15 14:19:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:04,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:04,939 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:04,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-15 14:19:04,940 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:04,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1994581657, now seen corresponding path program 1 times [2024-10-15 14:19:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208252907] [2024-10-15 14:19:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208252907] [2024-10-15 14:19:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208252907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2024-10-15 14:19:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777453961] [2024-10-15 14:19:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:06,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-15 14:19:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:06,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-15 14:19:06,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2024-10-15 14:19:06,014 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 48 states, 48 states have (on average 2.8958333333333335) internal successors, (139), 47 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:07,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:07,220 INFO L93 Difference]: Finished difference Result 237 states and 262 transitions. [2024-10-15 14:19:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-15 14:19:07,220 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.8958333333333335) internal successors, (139), 47 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:07,222 INFO L225 Difference]: With dead ends: 237 [2024-10-15 14:19:07,222 INFO L226 Difference]: Without dead ends: 188 [2024-10-15 14:19:07,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2024-10-15 14:19:07,224 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 163 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:07,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 28 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:19:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-15 14:19:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-15 14:19:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 184 states have (on average 1.1358695652173914) internal successors, (209), 184 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 212 transitions. [2024-10-15 14:19:07,236 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 212 transitions. Word has length 142 [2024-10-15 14:19:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:07,236 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 212 transitions. [2024-10-15 14:19:07,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.8958333333333335) internal successors, (139), 47 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:07,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 212 transitions. [2024-10-15 14:19:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:07,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:07,238 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:07,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-15 14:19:07,238 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:07,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:07,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1392620805, now seen corresponding path program 1 times [2024-10-15 14:19:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:07,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527450612] [2024-10-15 14:19:07,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:07,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:08,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527450612] [2024-10-15 14:19:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527450612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:08,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:08,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2024-10-15 14:19:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681926599] [2024-10-15 14:19:08,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:08,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-15 14:19:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:08,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-15 14:19:08,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2024-10-15 14:19:08,358 INFO L87 Difference]: Start difference. First operand 188 states and 212 transitions. Second operand has 50 states, 50 states have (on average 2.78) internal successors, (139), 49 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:09,665 INFO L93 Difference]: Finished difference Result 231 states and 255 transitions. [2024-10-15 14:19:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-15 14:19:09,666 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.78) internal successors, (139), 49 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:09,667 INFO L225 Difference]: With dead ends: 231 [2024-10-15 14:19:09,667 INFO L226 Difference]: Without dead ends: 184 [2024-10-15 14:19:09,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2024-10-15 14:19:09,670 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 161 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:09,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 25 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:19:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-15 14:19:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-15 14:19:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 180 states have (on average 1.1277777777777778) internal successors, (203), 180 states have internal predecessors, (203), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2024-10-15 14:19:09,682 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 142 [2024-10-15 14:19:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2024-10-15 14:19:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.78) internal successors, (139), 49 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2024-10-15 14:19:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:09,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:09,684 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-15 14:19:09,684 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash -484456345, now seen corresponding path program 1 times [2024-10-15 14:19:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443550932] [2024-10-15 14:19:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:10,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443550932] [2024-10-15 14:19:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443550932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:10,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-10-15 14:19:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513215189] [2024-10-15 14:19:10,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-15 14:19:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-15 14:19:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2024-10-15 14:19:10,918 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 51 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:12,204 INFO L93 Difference]: Finished difference Result 223 states and 245 transitions. [2024-10-15 14:19:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-15 14:19:12,205 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 51 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:12,206 INFO L225 Difference]: With dead ends: 223 [2024-10-15 14:19:12,206 INFO L226 Difference]: Without dead ends: 180 [2024-10-15 14:19:12,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2024-10-15 14:19:12,208 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 159 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:12,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 22 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:19:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-15 14:19:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-15 14:19:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.1193181818181819) internal successors, (197), 176 states have internal predecessors, (197), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2024-10-15 14:19:12,219 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 142 [2024-10-15 14:19:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:12,220 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2024-10-15 14:19:12,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 51 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:12,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2024-10-15 14:19:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:12,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:12,221 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:12,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-15 14:19:12,221 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:12,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1364261177, now seen corresponding path program 1 times [2024-10-15 14:19:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30221184] [2024-10-15 14:19:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:12,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:12,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30221184] [2024-10-15 14:19:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30221184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-15 14:19:12,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436663650] [2024-10-15 14:19:12,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-15 14:19:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:12,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 14:19:12,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:19:12,473 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:13,242 INFO L93 Difference]: Finished difference Result 483 states and 517 transitions. [2024-10-15 14:19:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-15 14:19:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:13,245 INFO L225 Difference]: With dead ends: 483 [2024-10-15 14:19:13,245 INFO L226 Difference]: Without dead ends: 480 [2024-10-15 14:19:13,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2024-10-15 14:19:13,247 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 712 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:13,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 13 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-15 14:19:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-15 14:19:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 419. [2024-10-15 14:19:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 415 states have (on average 1.0481927710843373) internal successors, (435), 415 states have internal predecessors, (435), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 438 transitions. [2024-10-15 14:19:13,280 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 438 transitions. Word has length 142 [2024-10-15 14:19:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:13,281 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 438 transitions. [2024-10-15 14:19:13,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 438 transitions. [2024-10-15 14:19:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:13,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:13,283 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-15 14:19:13,283 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:13,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 145194814, now seen corresponding path program 1 times [2024-10-15 14:19:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327178319] [2024-10-15 14:19:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327178319] [2024-10-15 14:19:14,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327178319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:14,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2024-10-15 14:19:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502251690] [2024-10-15 14:19:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:14,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-15 14:19:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-15 14:19:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=1532, Unknown=0, NotChecked=0, Total=2862 [2024-10-15 14:19:14,598 INFO L87 Difference]: Start difference. First operand 419 states and 438 transitions. Second operand has 54 states, 54 states have (on average 2.574074074074074) internal successors, (139), 53 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:15,763 INFO L93 Difference]: Finished difference Result 454 states and 473 transitions. [2024-10-15 14:19:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-15 14:19:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.574074074074074) internal successors, (139), 53 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:15,765 INFO L225 Difference]: With dead ends: 454 [2024-10-15 14:19:15,766 INFO L226 Difference]: Without dead ends: 146 [2024-10-15 14:19:15,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3984, Invalid=6936, Unknown=0, NotChecked=0, Total=10920 [2024-10-15 14:19:15,768 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 260 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:15,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 19 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:19:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-15 14:19:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-10-15 14:19:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2024-10-15 14:19:15,783 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 142 [2024-10-15 14:19:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:15,784 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2024-10-15 14:19:15,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.574074074074074) internal successors, (139), 53 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:15,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2024-10-15 14:19:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-15 14:19:15,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:15,785 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:15,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-15 14:19:15,786 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:15,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1356589483, now seen corresponding path program 1 times [2024-10-15 14:19:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709545861] [2024-10-15 14:19:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709545861] [2024-10-15 14:19:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709545861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2024-10-15 14:19:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927476930] [2024-10-15 14:19:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:17,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-15 14:19:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:17,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-15 14:19:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2024-10-15 14:19:17,841 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 71 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:20,004 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2024-10-15 14:19:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-15 14:19:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-10-15 14:19:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:20,006 INFO L225 Difference]: With dead ends: 185 [2024-10-15 14:19:20,006 INFO L226 Difference]: Without dead ends: 146 [2024-10-15 14:19:20,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2024-10-15 14:19:20,008 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 143 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:20,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 16 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:19:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-15 14:19:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-10-15 14:19:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.0070921985815602) internal successors, (142), 141 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2024-10-15 14:19:20,021 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2024-10-15 14:19:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:20,022 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2024-10-15 14:19:20,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:20,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2024-10-15 14:19:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-15 14:19:20,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:20,024 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:20,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-15 14:19:20,025 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:20,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1995090171, now seen corresponding path program 1 times [2024-10-15 14:19:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857478542] [2024-10-15 14:19:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:22,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857478542] [2024-10-15 14:19:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857478542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:19:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466660587] [2024-10-15 14:19:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:19:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:19:22,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:19:22,103 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:19:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:22,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-15 14:19:22,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:19:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:22,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:19:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466660587] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:19:25,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:19:25,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71, 71] total 104 [2024-10-15 14:19:25,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449286457] [2024-10-15 14:19:25,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:19:25,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-10-15 14:19:25,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:25,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-10-15 14:19:25,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2024-10-15 14:19:25,856 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand has 104 states, 104 states have (on average 2.7211538461538463) internal successors, (283), 103 states have internal predecessors, (283), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:30,050 INFO L93 Difference]: Finished difference Result 212 states and 243 transitions. [2024-10-15 14:19:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-10-15 14:19:30,051 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.7211538461538463) internal successors, (283), 103 states have internal predecessors, (283), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2024-10-15 14:19:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:30,053 INFO L225 Difference]: With dead ends: 212 [2024-10-15 14:19:30,053 INFO L226 Difference]: Without dead ends: 209 [2024-10-15 14:19:30,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 220 SyntacticMatches, 38 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7704 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=15556, Invalid=25856, Unknown=0, NotChecked=0, Total=41412 [2024-10-15 14:19:30,056 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 285 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:30,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 31 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:19:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-15 14:19:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-15 14:19:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.0048780487804878) internal successors, (206), 205 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2024-10-15 14:19:30,075 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 144 [2024-10-15 14:19:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:30,076 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2024-10-15 14:19:30,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.7211538461538463) internal successors, (283), 103 states have internal predecessors, (283), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:30,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2024-10-15 14:19:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-15 14:19:30,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:30,078 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:30,096 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:19:30,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:19:30,279 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash 619256389, now seen corresponding path program 2 times [2024-10-15 14:19:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209188447] [2024-10-15 14:19:30,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:30,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209188447] [2024-10-15 14:19:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209188447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:19:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825523457] [2024-10-15 14:19:31,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:19:31,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:19:31,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:19:31,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:19:31,997 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:19:32,104 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:19:32,104 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:19:32,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-15 14:19:32,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:19:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:32,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:19:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825523457] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:19:32,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:19:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2024-10-15 14:19:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142311808] [2024-10-15 14:19:32,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:19:32,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-15 14:19:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:32,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-15 14:19:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2024-10-15 14:19:32,717 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand has 56 states, 56 states have (on average 3.7142857142857144) internal successors, (208), 55 states have internal predecessors, (208), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:36,843 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2024-10-15 14:19:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-15 14:19:36,844 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.7142857142857144) internal successors, (208), 55 states have internal predecessors, (208), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 208 [2024-10-15 14:19:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:36,846 INFO L225 Difference]: With dead ends: 215 [2024-10-15 14:19:36,846 INFO L226 Difference]: Without dead ends: 212 [2024-10-15 14:19:36,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 416 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=319, Invalid=11237, Unknown=0, NotChecked=0, Total=11556 [2024-10-15 14:19:36,848 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 210 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 10770 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 10771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:36,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 160 Invalid, 10771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10770 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-15 14:19:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-15 14:19:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2024-10-15 14:19:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.0048309178743962) internal successors, (208), 207 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2024-10-15 14:19:36,870 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2024-10-15 14:19:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:36,871 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2024-10-15 14:19:36,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.7142857142857144) internal successors, (208), 55 states have internal predecessors, (208), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:36,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2024-10-15 14:19:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-15 14:19:36,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:19:36,872 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:19:36,891 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:19:37,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-15 14:19:37,073 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:19:37,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1902589665, now seen corresponding path program 3 times [2024-10-15 14:19:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:19:37,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42692683] [2024-10-15 14:19:37,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:19:37,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:19:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:19:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:19:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:19:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:19:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42692683] [2024-10-15 14:19:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42692683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:19:38,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:19:38,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2024-10-15 14:19:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803165785] [2024-10-15 14:19:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:19:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-15 14:19:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:19:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-15 14:19:38,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2024-10-15 14:19:38,737 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand has 53 states, 53 states have (on average 3.9056603773584904) internal successors, (207), 52 states have internal predecessors, (207), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:19:39,814 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2024-10-15 14:19:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-15 14:19:39,814 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.9056603773584904) internal successors, (207), 52 states have internal predecessors, (207), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 210 [2024-10-15 14:19:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:19:39,816 INFO L225 Difference]: With dead ends: 211 [2024-10-15 14:19:39,816 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:19:39,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2024-10-15 14:19:39,817 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 137 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:19:39,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 16 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:19:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:19:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:19:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 14:19:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:19:39,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2024-10-15 14:19:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:19:39,819 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:19:39,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.9056603773584904) internal successors, (207), 52 states have internal predecessors, (207), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:19:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:19:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:19:39,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:19:39,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:19:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-15 14:19:39,824 INFO L407 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1] [2024-10-15 14:19:39,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:19:40,957 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:19:40,997 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (= |old(~__return_1121~0)| ~__return_1121~0) Eliminated clause: true [2024-10-15 14:19:41,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:19:41 BoogieIcfgContainer [2024-10-15 14:19:41,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:19:41,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:19:41,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:19:41,001 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:19:41,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:18:34" (3/4) ... [2024-10-15 14:19:41,003 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:19:41,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:19:41,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:19:41,112 INFO L158 Benchmark]: Toolchain (without parser) took 67460.51ms. Allocated memory was 155.2MB in the beginning and 448.8MB in the end (delta: 293.6MB). Free memory was 122.0MB in the beginning and 151.9MB in the end (delta: -29.9MB). Peak memory consumption was 265.5MB. Max. memory is 16.1GB. [2024-10-15 14:19:41,112 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:19:41,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.20ms. Allocated memory is still 155.2MB. Free memory was 121.7MB in the beginning and 99.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-15 14:19:41,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.40ms. Allocated memory is still 155.2MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 979.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:19:41,113 INFO L158 Benchmark]: Boogie Preprocessor took 60.25ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 94.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:19:41,113 INFO L158 Benchmark]: RCFGBuilder took 783.63ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 48.7MB in the end (delta: 45.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-15 14:19:41,113 INFO L158 Benchmark]: TraceAbstraction took 65995.91ms. Allocated memory was 155.2MB in the beginning and 448.8MB in the end (delta: 293.6MB). Free memory was 123.9MB in the beginning and 156.1MB in the end (delta: -32.1MB). Peak memory consumption was 259.4MB. Max. memory is 16.1GB. [2024-10-15 14:19:41,114 INFO L158 Benchmark]: Witness Printer took 111.05ms. Allocated memory is still 448.8MB. Free memory was 156.1MB in the beginning and 151.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 14:19:41,114 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.20ms. Allocated memory is still 155.2MB. Free memory was 121.7MB in the beginning and 99.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.40ms. Allocated memory is still 155.2MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 979.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.25ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 94.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 783.63ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 48.7MB in the end (delta: 45.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 65995.91ms. Allocated memory was 155.2MB in the beginning and 448.8MB in the end (delta: 293.6MB). Free memory was 123.9MB in the beginning and 156.1MB in the end (delta: -32.1MB). Peak memory consumption was 259.4MB. Max. memory is 16.1GB. * Witness Printer took 111.05ms. Allocated memory is still 448.8MB. Free memory was 156.1MB in the beginning and 151.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 444]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.7s, OverallIterations: 32, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6773 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6773 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 11.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 976 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35564 IncrementalHoareTripleChecker+Invalid, 36540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 976 mSolverCounterUnsat, 98 mSDtfsCounter, 35564 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2759 GetRequests, 730 SyntacticMatches, 39 SemanticMatches, 1990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25161 ImplicationChecksByTransitivity, 35.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=419occurred in iteration=27, InterpolantAutomatonStates: 1074, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 65 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 5032 NumberOfCodeBlocks, 5032 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5348 ConstructedInterpolants, 0 QuantifiedInterpolants, 10873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 912 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 36 InterpolantComputations, 30 PerfectInterpolantSequences, 1156/4426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((2 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: (((7 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 383]: Location Invariant Derived location invariant: (((main__x == 61) && (main__y == 61)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 161]: Location Invariant Derived location invariant: (((main__x == 24) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 323]: Location Invariant Derived location invariant: (((51 == main__y) && (51 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 77]: Location Invariant Derived location invariant: (((10 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 233]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (36 == main__x)) - InvariantResult [Line: 251]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (39 == main__x)) - InvariantResult [Line: 203]: Location Invariant Derived location invariant: (((31 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 281]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (44 == main__x)) - InvariantResult [Line: 149]: Location Invariant Derived location invariant: (((22 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (5 == main__x)) - InvariantResult [Line: 197]: Location Invariant Derived location invariant: (((main__y == 50) && (30 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 119]: Location Invariant Derived location invariant: (((main__y == 50) && (17 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 215]: Location Invariant Derived location invariant: (((33 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 239]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (37 == main__x)) - InvariantResult [Line: 299]: Location Invariant Derived location invariant: (((main__y == 50) && (47 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 359]: Location Invariant Derived location invariant: (((\old(__return_1121) == __return_1121) && (57 == main__x)) && (57 == main__y)) - InvariantResult [Line: 137]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (20 == main__x)) - InvariantResult [Line: 245]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (38 == main__x)) - InvariantResult [Line: 335]: Location Invariant Derived location invariant: (((53 == main__y) && (53 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 395]: Location Invariant Derived location invariant: (((63 == main__x) && (63 == main__y)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 125]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (18 == main__x)) - InvariantResult [Line: 287]: Location Invariant Derived location invariant: (((main__y == 50) && (45 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: (((8 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 305]: Location Invariant Derived location invariant: (((48 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 401]: Location Invariant Derived location invariant: (((64 == main__x) && (64 == main__y)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 269]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (42 == main__x)) - InvariantResult [Line: 311]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (49 == main__x)) - InvariantResult [Line: 71]: Location Invariant Derived location invariant: (((9 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 131]: Location Invariant Derived location invariant: (((main__y == 50) && (19 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 191]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (29 == main__x)) - InvariantResult [Line: 347]: Location Invariant Derived location invariant: (((55 == main__x) && (\old(__return_1121) == __return_1121)) && (55 == main__y)) - InvariantResult [Line: 377]: Location Invariant Derived location invariant: (((60 == main__x) && (60 == main__y)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 41]: Location Invariant Derived location invariant: (((4 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 167]: Location Invariant Derived location invariant: (((25 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 407]: Location Invariant Derived location invariant: (((65 == main__y) && (\old(__return_1121) == __return_1121)) && (65 == main__x)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (3 == main__x)) - InvariantResult [Line: 371]: Location Invariant Derived location invariant: (((59 == main__y) && (\old(__return_1121) == __return_1121)) && (59 == main__x)) - InvariantResult [Line: 329]: Location Invariant Derived location invariant: (((52 == main__y) && (\old(__return_1121) == __return_1121)) && (52 == main__x)) - InvariantResult [Line: 107]: Location Invariant Derived location invariant: (((15 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 341]: Location Invariant Derived location invariant: (((main__y == 54) && (main__x == 54)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 420]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((74 == main__x) && (\old(__return_1121) == __return_1121)) && (74 == main__y)) || (((76 == main__y) && (76 == main__x)) && (\old(__return_1121) == __return_1121))) || (((73 == main__x) && (\old(__return_1121) == __return_1121)) && (73 == main__y))) || (((81 == main__y) && (\old(__return_1121) == __return_1121)) && (81 == main__x))) || (((87 == main__x) && (\old(__return_1121) == __return_1121)) && (87 == main__y))) || (((68 == main__x) && (\old(__return_1121) == __return_1121)) && (68 == main__y))) || (((97 == main__x) && (\old(__return_1121) == __return_1121)) && (97 == main__y))) || (((\old(__return_1121) == __return_1121) && (main__x == 93)) && (main__y == 93))) || (((\old(__return_1121) == __return_1121) && (77 == main__x)) && (77 == main__y))) || (((90 == main__x) && (\old(__return_1121) == __return_1121)) && (90 == main__y))) || (((95 == main__y) && (\old(__return_1121) == __return_1121)) && (95 == main__x))) || (((89 == main__y) && (89 == main__x)) && (\old(__return_1121) == __return_1121))) || (((98 == main__x) && (98 == main__y)) && (\old(__return_1121) == __return_1121))) || (((\old(__return_1121) == __return_1121) && (92 == main__y)) && (92 == main__x))) || (((main__y == 86) && (\old(__return_1121) == __return_1121)) && (main__x == 86))) || (((72 == main__x) && (72 == main__y)) && (\old(__return_1121) == __return_1121))) || (((79 == main__x) && (79 == main__y)) && (\old(__return_1121) == __return_1121))) || (((main__x == 96) && (main__y == 96)) && (\old(__return_1121) == __return_1121))) || (((84 == main__x) && (\old(__return_1121) == __return_1121)) && (84 == main__y))) || (((main__x == 83) && (\old(__return_1121) == __return_1121)) && (main__y == 83))) || (((78 == main__y) && (\old(__return_1121) == __return_1121)) && (78 == main__x))) || (((82 == main__x) && (\old(__return_1121) == __return_1121)) && (82 == main__y))) || (((main__x == 75) && (main__y == 75)) && (\old(__return_1121) == __return_1121))) || (((\old(__return_1121) == __return_1121) && (main__x == 80)) && (main__y == 80))) || (((main__y == 99) && (main__x == 99)) && (\old(__return_1121) == __return_1121))) || (((100 == main__y) && (100 <= main__x)) && (\old(__return_1121) == __return_1121))) || (((67 == main__x) && (67 == main__y)) && (\old(__return_1121) == __return_1121))) || (((85 == main__y) && (\old(__return_1121) == __return_1121)) && (85 == main__x))) || (((69 == main__y) && (\old(__return_1121) == __return_1121)) && (69 == main__x))) || (((88 == main__y) && (\old(__return_1121) == __return_1121)) && (88 == main__x))) || (((94 == main__y) && (94 == main__x)) && (\old(__return_1121) == __return_1121))) || (((71 == main__y) && (\old(__return_1121) == __return_1121)) && (71 == main__x))) || (((70 == main__x) && (\old(__return_1121) == __return_1121)) && (70 == main__y))) || (((91 == main__y) && (91 == main__x)) && (\old(__return_1121) == __return_1121))) - InvariantResult [Line: 83]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (11 == main__x)) - InvariantResult [Line: 185]: Location Invariant Derived location invariant: (((28 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 275]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (43 == main__x)) - InvariantResult [Line: 53]: Location Invariant Derived location invariant: (((main__y == 50) && (6 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 179]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 27)) - InvariantResult [Line: 353]: Location Invariant Derived location invariant: (((56 == main__x) && (\old(__return_1121) == __return_1121)) && (56 == main__y)) - InvariantResult [Line: 173]: Location Invariant Derived location invariant: (((26 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 413]: Location Invariant Derived location invariant: (((66 == main__y) && (66 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 263]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (41 == main__x)) - InvariantResult [Line: 143]: Location Invariant Derived location invariant: (((21 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 95]: Location Invariant Derived location invariant: (((13 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 221]: Location Invariant Derived location invariant: (((main__y == 50) && (34 == main__x)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 365]: Location Invariant Derived location invariant: (((58 == main__y) && (\old(__return_1121) == __return_1121)) && (58 == main__x)) - InvariantResult [Line: 227]: Location Invariant Derived location invariant: (((35 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 113]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (16 == main__x)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((main__x == 1) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 89]: Location Invariant Derived location invariant: (((12 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 101]: Location Invariant Derived location invariant: (((14 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 155]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (23 == main__x)) - InvariantResult [Line: 389]: Location Invariant Derived location invariant: (((62 == main__x) && (62 == main__y)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 293]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (46 == main__x)) - InvariantResult [Line: 317]: Location Invariant Derived location invariant: (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 50)) - InvariantResult [Line: 209]: Location Invariant Derived location invariant: (((32 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) - InvariantResult [Line: 257]: Location Invariant Derived location invariant: (((main__y == 50) && (40 == main__x)) && (\old(__return_1121) == __return_1121)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main. Ensures: (__return_main == \old(__return_main)) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:19:41,149 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE