./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9102a3dc168a1a089cfcbe45042daf88c4c5eebedf113fc0c98e676c1fbaab5b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:15:48,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:15:48,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:15:48,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:15:48,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:15:48,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:15:48,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:15:48,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:15:48,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:15:48,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:15:48,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:15:48,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:15:48,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:15:48,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:15:48,263 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:15:48,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:15:48,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:15:48,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:15:48,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:15:48,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:15:48,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:15:48,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:15:48,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:15:48,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:15:48,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:15:48,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:15:48,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:15:48,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:15:48,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:15:48,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:15:48,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:15:48,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:15:48,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:15:48,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:15:48,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:15:48,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:15:48,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:15:48,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:15:48,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:15:48,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:15:48,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:15:48,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:15:48,273 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9102a3dc168a1a089cfcbe45042daf88c4c5eebedf113fc0c98e676c1fbaab5b [2024-10-24 01:15:48,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:15:48,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:15:48,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:15:48,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:15:48,609 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:15:48,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c [2024-10-24 01:15:50,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:15:50,278 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:15:50,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c [2024-10-24 01:15:50,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281c02ceb/21655f68325545bc885518d6c6395ec3/FLAG9940d77ad [2024-10-24 01:15:50,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281c02ceb/21655f68325545bc885518d6c6395ec3 [2024-10-24 01:15:50,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:15:50,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:15:50,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:15:50,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:15:50,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:15:50,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380f3ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50, skipping insertion in model container [2024-10-24 01:15:50,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:15:50,533 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c[671,684] [2024-10-24 01:15:50,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:15:50,672 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:15:50,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c[671,684] [2024-10-24 01:15:50,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:15:50,791 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:15:50,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50 WrapperNode [2024-10-24 01:15:50,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:15:50,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:15:50,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:15:50,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:15:50,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,857 INFO L138 Inliner]: procedures = 48, calls = 62, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 765 [2024-10-24 01:15:50,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:15:50,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:15:50,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:15:50,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:15:50,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,904 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-24 01:15:50,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:15:50,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:15:50,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:15:50,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:15:50,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (1/1) ... [2024-10-24 01:15:50,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:15:50,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:15:50,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:15:50,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:15:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:15:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-24 01:15:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-24 01:15:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 01:15:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 01:15:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 01:15:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 01:15:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 01:15:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 01:15:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 01:15:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 01:15:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 01:15:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 01:15:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:15:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 01:15:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 01:15:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:15:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:15:51,191 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:15:51,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:15:51,983 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-24 01:15:51,983 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:15:52,061 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:15:52,061 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-24 01:15:52,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:15:52 BoogieIcfgContainer [2024-10-24 01:15:52,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:15:52,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:15:52,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:15:52,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:15:52,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:15:50" (1/3) ... [2024-10-24 01:15:52,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:15:52, skipping insertion in model container [2024-10-24 01:15:52,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:50" (2/3) ... [2024-10-24 01:15:52,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:15:52, skipping insertion in model container [2024-10-24 01:15:52,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:15:52" (3/3) ... [2024-10-24 01:15:52,071 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.10.cil-1.c [2024-10-24 01:15:52,086 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:15:52,086 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:15:52,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:15:52,173 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=LoopHeads, 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;@269ae77e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:15:52,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:15:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 310 states, 275 states have (on average 1.7345454545454546) internal successors, (477), 279 states have internal predecessors, (477), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 01:15:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:15:52,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:52,197 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] [2024-10-24 01:15:52,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2146509589, now seen corresponding path program 1 times [2024-10-24 01:15:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:52,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414369875] [2024-10-24 01:15:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:15:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:15:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:15:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:15:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,898 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-24 01:15:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:52,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414369875] [2024-10-24 01:15:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414369875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:52,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:52,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:15:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886842500] [2024-10-24 01:15:52,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:52,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:15:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:52,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:15:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:15:52,942 INFO L87 Difference]: Start difference. First operand has 310 states, 275 states have (on average 1.7345454545454546) internal successors, (477), 279 states have internal predecessors, (477), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:15:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:54,793 INFO L93 Difference]: Finished difference Result 725 states and 1249 transitions. [2024-10-24 01:15:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:15:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:15:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:54,817 INFO L225 Difference]: With dead ends: 725 [2024-10-24 01:15:54,817 INFO L226 Difference]: Without dead ends: 417 [2024-10-24 01:15:54,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:15:54,830 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 851 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:54,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 572 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 01:15:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-24 01:15:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 307. [2024-10-24 01:15:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 274 states have (on average 1.6313868613138687) internal successors, (447), 276 states have internal predecessors, (447), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 01:15:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 497 transitions. [2024-10-24 01:15:54,921 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 497 transitions. Word has length 141 [2024-10-24 01:15:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:54,922 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 497 transitions. [2024-10-24 01:15:54,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:15:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 497 transitions. [2024-10-24 01:15:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:15:54,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:54,928 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] [2024-10-24 01:15:54,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:15:54,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:54,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1730569005, now seen corresponding path program 1 times [2024-10-24 01:15:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119815854] [2024-10-24 01:15:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:15:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:15:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:15:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:15:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:55,207 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-24 01:15:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119815854] [2024-10-24 01:15:55,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119815854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:55,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:15:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926848205] [2024-10-24 01:15:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:55,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:15:55,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:55,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:15:55,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:15:55,211 INFO L87 Difference]: Start difference. First operand 307 states and 497 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:15:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:56,771 INFO L93 Difference]: Finished difference Result 712 states and 1170 transitions. [2024-10-24 01:15:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:15:56,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:15:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:56,779 INFO L225 Difference]: With dead ends: 712 [2024-10-24 01:15:56,780 INFO L226 Difference]: Without dead ends: 417 [2024-10-24 01:15:56,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:15:56,786 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 840 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:56,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 567 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 01:15:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-24 01:15:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 307. [2024-10-24 01:15:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 274 states have (on average 1.6277372262773722) internal successors, (446), 276 states have internal predecessors, (446), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 01:15:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 496 transitions. [2024-10-24 01:15:56,842 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 496 transitions. Word has length 141 [2024-10-24 01:15:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:56,843 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 496 transitions. [2024-10-24 01:15:56,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:15:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 496 transitions. [2024-10-24 01:15:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:15:56,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:56,847 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] [2024-10-24 01:15:56,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:15:56,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:56,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1979626641, now seen corresponding path program 1 times [2024-10-24 01:15:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:56,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183551689] [2024-10-24 01:15:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:56,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:15:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:15:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:15:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:15:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,174 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-24 01:15:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183551689] [2024-10-24 01:15:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183551689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:15:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544301042] [2024-10-24 01:15:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:57,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:15:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:57,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:15:57,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:15:57,176 INFO L87 Difference]: Start difference. First operand 307 states and 496 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:15:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:59,504 INFO L93 Difference]: Finished difference Result 1124 states and 1858 transitions. [2024-10-24 01:15:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:15:59,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:15:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:59,511 INFO L225 Difference]: With dead ends: 1124 [2024-10-24 01:15:59,513 INFO L226 Difference]: Without dead ends: 833 [2024-10-24 01:15:59,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:15:59,516 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1274 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:59,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 957 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 01:15:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-10-24 01:15:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 612. [2024-10-24 01:15:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 553 states have (on average 1.6383363471971066) internal successors, (906), 556 states have internal predecessors, (906), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2024-10-24 01:15:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 997 transitions. [2024-10-24 01:15:59,569 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 997 transitions. Word has length 141 [2024-10-24 01:15:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:59,570 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 997 transitions. [2024-10-24 01:15:59,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:15:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 997 transitions. [2024-10-24 01:15:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:15:59,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:59,572 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] [2024-10-24 01:15:59,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:15:59,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:59,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1805366959, now seen corresponding path program 1 times [2024-10-24 01:15:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:59,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112609445] [2024-10-24 01:15:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:59,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:15:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:15:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:15:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:59,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:15:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:59,870 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-24 01:15:59,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112609445] [2024-10-24 01:15:59,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112609445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:59,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790388296] [2024-10-24 01:15:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:59,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:59,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:59,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:59,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:59,873 INFO L87 Difference]: Start difference. First operand 612 states and 997 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:02,978 INFO L93 Difference]: Finished difference Result 1859 states and 3076 transitions. [2024-10-24 01:16:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:02,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:02,986 INFO L225 Difference]: With dead ends: 1859 [2024-10-24 01:16:02,986 INFO L226 Difference]: Without dead ends: 1263 [2024-10-24 01:16:02,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:16:02,989 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1301 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:02,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1827 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 01:16:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-24 01:16:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 894. [2024-10-24 01:16:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 809 states have (on average 1.6316440049443757) internal successors, (1320), 813 states have internal predecessors, (1320), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-10-24 01:16:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1451 transitions. [2024-10-24 01:16:03,060 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1451 transitions. Word has length 141 [2024-10-24 01:16:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:03,061 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1451 transitions. [2024-10-24 01:16:03,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1451 transitions. [2024-10-24 01:16:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:03,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:03,063 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] [2024-10-24 01:16:03,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:16:03,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:03,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:03,064 INFO L85 PathProgramCache]: Analyzing trace with hash -245041939, now seen corresponding path program 1 times [2024-10-24 01:16:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:03,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96722948] [2024-10-24 01:16:03,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:03,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:03,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:03,336 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-24 01:16:03,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:03,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96722948] [2024-10-24 01:16:03,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96722948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:03,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:03,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:03,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030189804] [2024-10-24 01:16:03,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:03,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:03,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:03,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:03,339 INFO L87 Difference]: Start difference. First operand 894 states and 1451 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:06,212 INFO L93 Difference]: Finished difference Result 2936 states and 4850 transitions. [2024-10-24 01:16:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:06,224 INFO L225 Difference]: With dead ends: 2936 [2024-10-24 01:16:06,224 INFO L226 Difference]: Without dead ends: 2058 [2024-10-24 01:16:06,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:16:06,229 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1403 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:06,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1182 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 01:16:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2024-10-24 01:16:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1459. [2024-10-24 01:16:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1322 states have (on average 1.6255673222390317) internal successors, (2149), 1328 states have internal predecessors, (2149), 102 states have call successors, (102), 31 states have call predecessors, (102), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-24 01:16:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2364 transitions. [2024-10-24 01:16:06,357 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2364 transitions. Word has length 141 [2024-10-24 01:16:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:06,358 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2364 transitions. [2024-10-24 01:16:06,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2364 transitions. [2024-10-24 01:16:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:06,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:06,361 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] [2024-10-24 01:16:06,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:16:06,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 243005167, now seen corresponding path program 1 times [2024-10-24 01:16:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107489604] [2024-10-24 01:16:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:06,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:06,623 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-24 01:16:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107489604] [2024-10-24 01:16:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107489604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:06,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:06,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773830817] [2024-10-24 01:16:06,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:06,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:06,628 INFO L87 Difference]: Start difference. First operand 1459 states and 2364 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:08,068 INFO L93 Difference]: Finished difference Result 3485 states and 5746 transitions. [2024-10-24 01:16:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:08,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:08,079 INFO L225 Difference]: With dead ends: 3485 [2024-10-24 01:16:08,079 INFO L226 Difference]: Without dead ends: 2042 [2024-10-24 01:16:08,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:16:08,085 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1070 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:08,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 780 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 01:16:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2024-10-24 01:16:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1459. [2024-10-24 01:16:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1322 states have (on average 1.62178517397882) internal successors, (2144), 1328 states have internal predecessors, (2144), 102 states have call successors, (102), 31 states have call predecessors, (102), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-24 01:16:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2359 transitions. [2024-10-24 01:16:08,223 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2359 transitions. Word has length 141 [2024-10-24 01:16:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:08,224 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2359 transitions. [2024-10-24 01:16:08,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2359 transitions. [2024-10-24 01:16:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:08,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:08,226 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] [2024-10-24 01:16:08,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:16:08,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:08,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1039167119, now seen corresponding path program 1 times [2024-10-24 01:16:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083676679] [2024-10-24 01:16:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:08,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:08,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:08,458 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-24 01:16:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083676679] [2024-10-24 01:16:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083676679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:08,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262601218] [2024-10-24 01:16:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:08,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:08,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:08,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:08,460 INFO L87 Difference]: Start difference. First operand 1459 states and 2359 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:09,828 INFO L93 Difference]: Finished difference Result 3479 states and 5719 transitions. [2024-10-24 01:16:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:09,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:09,844 INFO L225 Difference]: With dead ends: 3479 [2024-10-24 01:16:09,845 INFO L226 Difference]: Without dead ends: 2036 [2024-10-24 01:16:09,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:16:09,853 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1068 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:09,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 780 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:16:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2024-10-24 01:16:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1459. [2024-10-24 01:16:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1322 states have (on average 1.6180030257186082) internal successors, (2139), 1328 states have internal predecessors, (2139), 102 states have call successors, (102), 31 states have call predecessors, (102), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-24 01:16:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2354 transitions. [2024-10-24 01:16:09,956 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2354 transitions. Word has length 141 [2024-10-24 01:16:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:09,956 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2354 transitions. [2024-10-24 01:16:09,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2354 transitions. [2024-10-24 01:16:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:09,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:09,959 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] [2024-10-24 01:16:09,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:16:09,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:09,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1413324463, now seen corresponding path program 1 times [2024-10-24 01:16:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:09,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389264480] [2024-10-24 01:16:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:10,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:10,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:10,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:10,222 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-24 01:16:10,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:10,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389264480] [2024-10-24 01:16:10,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389264480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:10,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:10,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:10,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203637635] [2024-10-24 01:16:10,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:10,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:10,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:10,225 INFO L87 Difference]: Start difference. First operand 1459 states and 2354 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:13,005 INFO L93 Difference]: Finished difference Result 4986 states and 8159 transitions. [2024-10-24 01:16:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:13,022 INFO L225 Difference]: With dead ends: 4986 [2024-10-24 01:16:13,022 INFO L226 Difference]: Without dead ends: 3543 [2024-10-24 01:16:13,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:16:13,027 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1285 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:13,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 1825 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 01:16:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2024-10-24 01:16:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 2605. [2024-10-24 01:16:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2364 states have (on average 1.612098138747885) internal successors, (3811), 2374 states have internal predecessors, (3811), 178 states have call successors, (178), 55 states have call predecessors, (178), 62 states have return successors, (211), 183 states have call predecessors, (211), 176 states have call successors, (211) [2024-10-24 01:16:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4200 transitions. [2024-10-24 01:16:13,197 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4200 transitions. Word has length 141 [2024-10-24 01:16:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 4200 transitions. [2024-10-24 01:16:13,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4200 transitions. [2024-10-24 01:16:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:13,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:13,200 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] [2024-10-24 01:16:13,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:16:13,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash -308678223, now seen corresponding path program 1 times [2024-10-24 01:16:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:13,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679910553] [2024-10-24 01:16:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,444 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-24 01:16:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679910553] [2024-10-24 01:16:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679910553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:13,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:13,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626360078] [2024-10-24 01:16:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:13,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:13,446 INFO L87 Difference]: Start difference. First operand 2605 states and 4200 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:14,799 INFO L93 Difference]: Finished difference Result 6147 states and 10062 transitions. [2024-10-24 01:16:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:14,817 INFO L225 Difference]: With dead ends: 6147 [2024-10-24 01:16:14,817 INFO L226 Difference]: Without dead ends: 3558 [2024-10-24 01:16:14,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:16:14,827 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1067 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:14,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 780 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:16:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2024-10-24 01:16:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 2605. [2024-10-24 01:16:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2364 states have (on average 1.6082910321489001) internal successors, (3802), 2374 states have internal predecessors, (3802), 178 states have call successors, (178), 55 states have call predecessors, (178), 62 states have return successors, (211), 183 states have call predecessors, (211), 176 states have call successors, (211) [2024-10-24 01:16:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4191 transitions. [2024-10-24 01:16:15,059 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4191 transitions. Word has length 141 [2024-10-24 01:16:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:15,060 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 4191 transitions. [2024-10-24 01:16:15,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4191 transitions. [2024-10-24 01:16:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:15,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:15,064 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] [2024-10-24 01:16:15,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:16:15,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:15,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:15,065 INFO L85 PathProgramCache]: Analyzing trace with hash -641321361, now seen corresponding path program 1 times [2024-10-24 01:16:15,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:15,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578747809] [2024-10-24 01:16:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:15,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:15,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:15,320 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-24 01:16:15,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:15,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578747809] [2024-10-24 01:16:15,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578747809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:15,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:15,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:15,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755693507] [2024-10-24 01:16:15,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:15,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:15,322 INFO L87 Difference]: Start difference. First operand 2605 states and 4191 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:18,590 INFO L93 Difference]: Finished difference Result 9112 states and 14847 transitions. [2024-10-24 01:16:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:18,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:18,623 INFO L225 Difference]: With dead ends: 9112 [2024-10-24 01:16:18,624 INFO L226 Difference]: Without dead ends: 6523 [2024-10-24 01:16:18,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:16:18,634 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1277 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3073 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:18,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1825 Invalid, 3136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3073 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 01:16:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2024-10-24 01:16:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 4907. [2024-10-24 01:16:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4907 states, 4458 states have (on average 1.6029609690444144) internal successors, (7146), 4476 states have internal predecessors, (7146), 330 states have call successors, (330), 103 states have call predecessors, (330), 118 states have return successors, (425), 343 states have call predecessors, (425), 328 states have call successors, (425) [2024-10-24 01:16:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 7901 transitions. [2024-10-24 01:16:19,012 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 7901 transitions. Word has length 141 [2024-10-24 01:16:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:19,013 INFO L471 AbstractCegarLoop]: Abstraction has 4907 states and 7901 transitions. [2024-10-24 01:16:19,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 7901 transitions. [2024-10-24 01:16:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:19,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:19,019 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] [2024-10-24 01:16:19,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:16:19,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:19,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1287610865, now seen corresponding path program 1 times [2024-10-24 01:16:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201888231] [2024-10-24 01:16:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,296 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-24 01:16:19,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:19,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201888231] [2024-10-24 01:16:19,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201888231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:19,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608950758] [2024-10-24 01:16:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:19,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:19,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:19,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:19,299 INFO L87 Difference]: Start difference. First operand 4907 states and 7901 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:22,305 INFO L93 Difference]: Finished difference Result 17380 states and 28355 transitions. [2024-10-24 01:16:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:22,398 INFO L225 Difference]: With dead ends: 17380 [2024-10-24 01:16:22,399 INFO L226 Difference]: Without dead ends: 12489 [2024-10-24 01:16:22,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:16:22,415 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1276 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:22,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1825 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3060 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 01:16:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12489 states. [2024-10-24 01:16:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12489 to 9524. [2024-10-24 01:16:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9524 states, 8659 states have (on average 1.5997228317357663) internal successors, (13852), 8693 states have internal predecessors, (13852), 634 states have call successors, (634), 199 states have call predecessors, (634), 230 states have return successors, (907), 663 states have call predecessors, (907), 632 states have call successors, (907) [2024-10-24 01:16:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9524 states to 9524 states and 15393 transitions. [2024-10-24 01:16:23,129 INFO L78 Accepts]: Start accepts. Automaton has 9524 states and 15393 transitions. Word has length 141 [2024-10-24 01:16:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:23,130 INFO L471 AbstractCegarLoop]: Abstraction has 9524 states and 15393 transitions. [2024-10-24 01:16:23,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9524 states and 15393 transitions. [2024-10-24 01:16:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:23,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:23,137 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] [2024-10-24 01:16:23,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:16:23,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:23,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1005470161, now seen corresponding path program 1 times [2024-10-24 01:16:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640983601] [2024-10-24 01:16:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,365 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-24 01:16:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:23,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640983601] [2024-10-24 01:16:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640983601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:23,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803339622] [2024-10-24 01:16:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:23,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:23,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:23,367 INFO L87 Difference]: Start difference. First operand 9524 states and 15393 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:26,884 INFO L93 Difference]: Finished difference Result 33915 states and 55561 transitions. [2024-10-24 01:16:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:26,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:26,993 INFO L225 Difference]: With dead ends: 33915 [2024-10-24 01:16:26,994 INFO L226 Difference]: Without dead ends: 24407 [2024-10-24 01:16:27,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:16:27,037 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1364 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:27,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1182 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 01:16:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24407 states. [2024-10-24 01:16:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24407 to 18789. [2024-10-24 01:16:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18789 states, 17092 states have (on average 1.597823543178095) internal successors, (27310), 17158 states have internal predecessors, (27310), 1242 states have call successors, (1242), 391 states have call predecessors, (1242), 454 states have return successors, (2033), 1303 states have call predecessors, (2033), 1240 states have call successors, (2033) [2024-10-24 01:16:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18789 states to 18789 states and 30585 transitions. [2024-10-24 01:16:28,360 INFO L78 Accepts]: Start accepts. Automaton has 18789 states and 30585 transitions. Word has length 141 [2024-10-24 01:16:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:28,360 INFO L471 AbstractCegarLoop]: Abstraction has 18789 states and 30585 transitions. [2024-10-24 01:16:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18789 states and 30585 transitions. [2024-10-24 01:16:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:28,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:28,374 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] [2024-10-24 01:16:28,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:16:28,374 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash 721674801, now seen corresponding path program 1 times [2024-10-24 01:16:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:28,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967283526] [2024-10-24 01:16:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,591 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-24 01:16:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967283526] [2024-10-24 01:16:28,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967283526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:28,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:28,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289702275] [2024-10-24 01:16:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:28,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:28,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:28,594 INFO L87 Difference]: Start difference. First operand 18789 states and 30585 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:34,569 INFO L93 Difference]: Finished difference Result 74408 states and 122669 transitions. [2024-10-24 01:16:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:16:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:34,819 INFO L225 Difference]: With dead ends: 74408 [2024-10-24 01:16:34,819 INFO L226 Difference]: Without dead ends: 55635 [2024-10-24 01:16:34,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:16:34,892 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1358 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 3569 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 3634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:34,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 1814 Invalid, 3634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3569 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 01:16:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55635 states. [2024-10-24 01:16:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55635 to 36679. [2024-10-24 01:16:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36679 states, 33382 states have (on average 1.5946917500449345) internal successors, (53234), 33512 states have internal predecessors, (53234), 2394 states have call successors, (2394), 775 states have call predecessors, (2394), 902 states have return successors, (4707), 2519 states have call predecessors, (4707), 2392 states have call successors, (4707) [2024-10-24 01:16:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36679 states to 36679 states and 60335 transitions. [2024-10-24 01:16:37,829 INFO L78 Accepts]: Start accepts. Automaton has 36679 states and 60335 transitions. Word has length 141 [2024-10-24 01:16:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:37,830 INFO L471 AbstractCegarLoop]: Abstraction has 36679 states and 60335 transitions. [2024-10-24 01:16:37,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 36679 states and 60335 transitions. [2024-10-24 01:16:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:37,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:37,850 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] [2024-10-24 01:16:37,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:16:37,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash -925688141, now seen corresponding path program 1 times [2024-10-24 01:16:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:37,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100509277] [2024-10-24 01:16:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:38,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:38,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:38,073 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-24 01:16:38,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:38,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100509277] [2024-10-24 01:16:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100509277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:38,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:38,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130824939] [2024-10-24 01:16:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:38,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:38,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:38,075 INFO L87 Difference]: Start difference. First operand 36679 states and 60335 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:42,249 INFO L93 Difference]: Finished difference Result 84579 states and 141867 transitions. [2024-10-24 01:16:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:42,481 INFO L225 Difference]: With dead ends: 84579 [2024-10-24 01:16:42,482 INFO L226 Difference]: Without dead ends: 47916 [2024-10-24 01:16:42,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:16:42,592 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 940 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:42,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 928 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 01:16:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47916 states. [2024-10-24 01:16:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47916 to 36679. [2024-10-24 01:16:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36679 states, 33382 states have (on average 1.5908273920076688) internal successors, (53105), 33512 states have internal predecessors, (53105), 2394 states have call successors, (2394), 775 states have call predecessors, (2394), 902 states have return successors, (4707), 2519 states have call predecessors, (4707), 2392 states have call successors, (4707) [2024-10-24 01:16:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36679 states to 36679 states and 60206 transitions. [2024-10-24 01:16:45,631 INFO L78 Accepts]: Start accepts. Automaton has 36679 states and 60206 transitions. Word has length 141 [2024-10-24 01:16:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:45,632 INFO L471 AbstractCegarLoop]: Abstraction has 36679 states and 60206 transitions. [2024-10-24 01:16:45,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 36679 states and 60206 transitions. [2024-10-24 01:16:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:16:45,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:45,650 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] [2024-10-24 01:16:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:16:45,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1237928433, now seen corresponding path program 1 times [2024-10-24 01:16:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:45,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151260074] [2024-10-24 01:16:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:16:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:16:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:16:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:16:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:45,862 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-24 01:16:45,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:45,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151260074] [2024-10-24 01:16:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151260074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839100000] [2024-10-24 01:16:45,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:45,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:45,864 INFO L87 Difference]: Start difference. First operand 36679 states and 60206 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:16:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:54,287 INFO L93 Difference]: Finished difference Result 142662 states and 237101 transitions. [2024-10-24 01:16:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:16:54,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-24 01:16:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:54,712 INFO L225 Difference]: With dead ends: 142662 [2024-10-24 01:16:54,712 INFO L226 Difference]: Without dead ends: 105999 [2024-10-24 01:16:54,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:16:54,814 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 1527 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:54,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 1818 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 01:16:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105999 states. [2024-10-24 01:17:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105999 to 73225. [2024-10-24 01:17:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73225 states, 66792 states have (on average 1.5904449634686788) internal successors, (106229), 67050 states have internal predecessors, (106229), 4634 states have call successors, (4634), 1543 states have call predecessors, (4634), 1798 states have return successors, (11449), 4887 states have call predecessors, (11449), 4632 states have call successors, (11449) [2024-10-24 01:17:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73225 states to 73225 states and 122312 transitions. [2024-10-24 01:17:00,641 INFO L78 Accepts]: Start accepts. Automaton has 73225 states and 122312 transitions. Word has length 141 [2024-10-24 01:17:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:00,642 INFO L471 AbstractCegarLoop]: Abstraction has 73225 states and 122312 transitions. [2024-10-24 01:17:00,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:17:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 73225 states and 122312 transitions. [2024-10-24 01:17:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:17:00,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:00,678 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] [2024-10-24 01:17:00,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:17:00,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:00,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash 199343859, now seen corresponding path program 1 times [2024-10-24 01:17:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:00,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564770795] [2024-10-24 01:17:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:00,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:00,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:17:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:17:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:17:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:17:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:00,880 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-24 01:17:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564770795] [2024-10-24 01:17:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564770795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376295209] [2024-10-24 01:17:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:00,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:00,884 INFO L87 Difference]: Start difference. First operand 73225 states and 122312 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)