./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:35:47,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:35:48,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:35:48,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:35:48,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:35:48,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:35:48,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:35:48,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:35:48,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:35:48,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:35:48,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:35:48,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:35:48,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:35:48,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:35:48,133 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:35:48,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:35:48,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:35:48,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:35:48,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:35:48,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:35:48,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:35:48,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:35:48,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:35:48,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:35:48,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:35:48,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:35:48,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:35:48,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:35:48,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:35:48,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:35:48,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:35:48,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:35:48,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:48,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:35:48,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:35:48,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:35:48,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:35:48,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:35:48,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:35:48,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:35:48,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:35:48,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:35:48,144 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-clean/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-clean/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 -> c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d [2024-10-11 02:35:48,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:35:48,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:35:48,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:35:48,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:35:48,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:35:48,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2024-10-11 02:35:49,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:35:50,171 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:35:50,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2024-10-11 02:35:50,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a35d164c7/1cf5e3eda98b4b60af85f0ccd511c8be/FLAG5111f2338 [2024-10-11 02:35:50,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a35d164c7/1cf5e3eda98b4b60af85f0ccd511c8be [2024-10-11 02:35:50,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:35:50,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:35:50,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:50,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:35:50,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:35:50,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:50" (1/1) ... [2024-10-11 02:35:50,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ff2ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:50, skipping insertion in model container [2024-10-11 02:35:50,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:50" (1/1) ... [2024-10-11 02:35:50,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:35:50,845 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/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2024-10-11 02:35:50,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:50,867 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:35:50,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-11 02:35:50,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [412] [2024-10-11 02:35:50,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1940] [2024-10-11 02:35:50,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2058] [2024-10-11 02:35:50,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2070] [2024-10-11 02:35:50,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2436] [2024-10-11 02:35:50,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2471] [2024-10-11 02:35:50,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3132] [2024-10-11 02:35:50,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3314] [2024-10-11 02:35:50,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3323] [2024-10-11 02:35:50,989 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/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2024-10-11 02:35:50,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:51,030 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:35:51,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51 WrapperNode [2024-10-11 02:35:51,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:51,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:51,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:35:51,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:35:51,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,125 INFO L138 Inliner]: procedures = 93, calls = 340, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 860 [2024-10-11 02:35:51,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:51,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:35:51,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:35:51,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:35:51,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,178 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:35:51,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:35:51,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:35:51,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:35:51,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:35:51,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (1/1) ... [2024-10-11 02:35:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:35:51,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:35:51,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:35:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:35:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:35:51,373 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:35:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:35:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:35:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:35:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:35:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:35:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:35:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:35:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:35:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:35:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:35:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:35:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:35:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:35:51,377 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:35:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:35:51,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:35:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:35:51,378 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:35:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:35:51,378 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:35:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:35:51,379 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:35:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:35:51,379 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:35:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:35:51,380 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:35:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2024-10-11 02:35:51,380 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2024-10-11 02:35:51,380 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:35:51,381 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:35:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:35:51,381 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:35:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:35:51,381 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:35:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:35:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:35:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:35:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:35:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:35:51,383 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:35:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:35:51,383 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:35:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:35:51,384 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:35:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:35:51,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:35:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:35:51,384 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:35:51,620 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:35:51,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:35:52,862 INFO L? ?]: Removed 441 outVars from TransFormulas that were not future-live. [2024-10-11 02:35:52,863 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:35:52,968 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:35:52,968 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:35:52,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:52 BoogieIcfgContainer [2024-10-11 02:35:52,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:35:52,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:35:52,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:35:52,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:35:52,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:35:50" (1/3) ... [2024-10-11 02:35:52,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dccb7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:52, skipping insertion in model container [2024-10-11 02:35:52,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:51" (2/3) ... [2024-10-11 02:35:52,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dccb7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:52, skipping insertion in model container [2024-10-11 02:35:52,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:52" (3/3) ... [2024-10-11 02:35:52,982 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2024-10-11 02:35:53,000 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:35:53,001 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:35:53,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:35:53,107 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;@75fa552b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:35:53,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:35:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 414 states have (on average 1.7439613526570048) internal successors, (722), 437 states have internal predecessors, (722), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-11 02:35:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 02:35:53,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:53,131 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] [2024-10-11 02:35:53,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:53,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:53,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1949591273, now seen corresponding path program 1 times [2024-10-11 02:35:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684146039] [2024-10-11 02:35:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:53,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:35:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:35:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,382 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-11 02:35:54,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:54,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684146039] [2024-10-11 02:35:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684146039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:54,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850128301] [2024-10-11 02:35:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:54,424 INFO L87 Difference]: Start difference. First operand has 529 states, 414 states have (on average 1.7439613526570048) internal successors, (722), 437 states have internal predecessors, (722), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:35:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:59,729 INFO L93 Difference]: Finished difference Result 1201 states and 2076 transitions. [2024-10-11 02:35:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:59,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-10-11 02:35:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:59,765 INFO L225 Difference]: With dead ends: 1201 [2024-10-11 02:35:59,768 INFO L226 Difference]: Without dead ends: 681 [2024-10-11 02:35:59,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:35:59,780 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 667 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:59,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1046 Invalid, 2837 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:35:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-11 02:35:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-11 02:35:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.733009708737864) internal successors, (714), 433 states have internal predecessors, (714), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:35:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 891 transitions. [2024-10-11 02:35:59,962 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 891 transitions. Word has length 46 [2024-10-11 02:35:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:59,964 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 891 transitions. [2024-10-11 02:35:59,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:35:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 891 transitions. [2024-10-11 02:35:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 02:35:59,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:59,971 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] [2024-10-11 02:35:59,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:35:59,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:59,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash 51341049, now seen corresponding path program 1 times [2024-10-11 02:35:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:59,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044126187] [2024-10-11 02:35:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:36:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:00,675 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-11 02:36:00,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:00,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044126187] [2024-10-11 02:36:00,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044126187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:00,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402437821] [2024-10-11 02:36:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:00,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:00,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:00,679 INFO L87 Difference]: Start difference. First operand 525 states and 891 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:04,935 INFO L93 Difference]: Finished difference Result 1194 states and 2049 transitions. [2024-10-11 02:36:04,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:04,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-11 02:36:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:04,943 INFO L225 Difference]: With dead ends: 1194 [2024-10-11 02:36:04,943 INFO L226 Difference]: Without dead ends: 681 [2024-10-11 02:36:04,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:04,947 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1091 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:04,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1056 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 02:36:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-11 02:36:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-11 02:36:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7305825242718447) internal successors, (713), 433 states have internal predecessors, (713), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:36:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 890 transitions. [2024-10-11 02:36:05,034 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 890 transitions. Word has length 48 [2024-10-11 02:36:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:05,034 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 890 transitions. [2024-10-11 02:36:05,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 890 transitions. [2024-10-11 02:36:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 02:36:05,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:05,037 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] [2024-10-11 02:36:05,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:36:05,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:05,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1225420843, now seen corresponding path program 1 times [2024-10-11 02:36:05,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:05,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943390401] [2024-10-11 02:36:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:36:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:36:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943390401] [2024-10-11 02:36:05,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943390401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:05,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:05,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440273997] [2024-10-11 02:36:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:05,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:05,656 INFO L87 Difference]: Start difference. First operand 525 states and 890 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:09,352 INFO L93 Difference]: Finished difference Result 1194 states and 2048 transitions. [2024-10-11 02:36:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-10-11 02:36:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:09,358 INFO L225 Difference]: With dead ends: 1194 [2024-10-11 02:36:09,359 INFO L226 Difference]: Without dead ends: 681 [2024-10-11 02:36:09,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:09,363 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1090 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:09,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1041 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2546 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:36:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-11 02:36:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-11 02:36:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7281553398058251) internal successors, (712), 433 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:36:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 889 transitions. [2024-10-11 02:36:09,456 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 889 transitions. Word has length 49 [2024-10-11 02:36:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:09,456 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 889 transitions. [2024-10-11 02:36:09,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 889 transitions. [2024-10-11 02:36:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 02:36:09,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:09,459 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] [2024-10-11 02:36:09,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:36:09,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:09,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1303040387, now seen corresponding path program 1 times [2024-10-11 02:36:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296030855] [2024-10-11 02:36:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:36:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:36:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:10,027 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-11 02:36:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:10,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296030855] [2024-10-11 02:36:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296030855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:10,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:10,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641094670] [2024-10-11 02:36:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:10,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:10,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:10,030 INFO L87 Difference]: Start difference. First operand 525 states and 889 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:13,986 INFO L93 Difference]: Finished difference Result 1194 states and 2047 transitions. [2024-10-11 02:36:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:13,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-10-11 02:36:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:13,991 INFO L225 Difference]: With dead ends: 1194 [2024-10-11 02:36:13,991 INFO L226 Difference]: Without dead ends: 681 [2024-10-11 02:36:13,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:13,995 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 661 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:13,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1058 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:36:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-11 02:36:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-11 02:36:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7257281553398058) internal successors, (711), 433 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:36:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 888 transitions. [2024-10-11 02:36:14,066 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 888 transitions. Word has length 50 [2024-10-11 02:36:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:14,067 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 888 transitions. [2024-10-11 02:36:14,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 888 transitions. [2024-10-11 02:36:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 02:36:14,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:14,068 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] [2024-10-11 02:36:14,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:36:14,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:14,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1433014489, now seen corresponding path program 1 times [2024-10-11 02:36:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:14,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230178966] [2024-10-11 02:36:14,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:36:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:36:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,590 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-11 02:36:14,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230178966] [2024-10-11 02:36:14,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230178966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:14,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:14,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:14,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394806233] [2024-10-11 02:36:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:14,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:14,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:14,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:14,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:14,592 INFO L87 Difference]: Start difference. First operand 525 states and 888 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:18,604 INFO L93 Difference]: Finished difference Result 1194 states and 2046 transitions. [2024-10-11 02:36:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2024-10-11 02:36:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:18,609 INFO L225 Difference]: With dead ends: 1194 [2024-10-11 02:36:18,609 INFO L226 Difference]: Without dead ends: 681 [2024-10-11 02:36:18,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:18,613 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 659 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:18,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1058 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:36:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-11 02:36:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-11 02:36:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7233009708737863) internal successors, (710), 433 states have internal predecessors, (710), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:36:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 887 transitions. [2024-10-11 02:36:18,693 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 887 transitions. Word has length 51 [2024-10-11 02:36:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 887 transitions. [2024-10-11 02:36:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 887 transitions. [2024-10-11 02:36:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:36:18,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:18,695 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] [2024-10-11 02:36:18,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:36:18,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1198663169, now seen corresponding path program 1 times [2024-10-11 02:36:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759592614] [2024-10-11 02:36:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:18,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:19,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:36:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:19,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:19,301 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-11 02:36:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:19,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759592614] [2024-10-11 02:36:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759592614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:19,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:19,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:19,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804934019] [2024-10-11 02:36:19,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:19,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:19,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:19,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:19,304 INFO L87 Difference]: Start difference. First operand 525 states and 887 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:23,176 INFO L93 Difference]: Finished difference Result 1164 states and 1985 transitions. [2024-10-11 02:36:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2024-10-11 02:36:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:23,181 INFO L225 Difference]: With dead ends: 1164 [2024-10-11 02:36:23,181 INFO L226 Difference]: Without dead ends: 691 [2024-10-11 02:36:23,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:23,185 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 719 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:23,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1064 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:36:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-11 02:36:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 525. [2024-10-11 02:36:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7111650485436893) internal successors, (705), 433 states have internal predecessors, (705), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:36:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 882 transitions. [2024-10-11 02:36:23,263 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 882 transitions. Word has length 52 [2024-10-11 02:36:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:23,264 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 882 transitions. [2024-10-11 02:36:23,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 882 transitions. [2024-10-11 02:36:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 02:36:23,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:23,265 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] [2024-10-11 02:36:23,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:36:23,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1938051908, now seen corresponding path program 1 times [2024-10-11 02:36:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118830598] [2024-10-11 02:36:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:36:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:23,846 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-11 02:36:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118830598] [2024-10-11 02:36:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118830598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:23,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:23,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380228510] [2024-10-11 02:36:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:23,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:23,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:23,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:23,848 INFO L87 Difference]: Start difference. First operand 525 states and 882 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:27,195 INFO L93 Difference]: Finished difference Result 1164 states and 1980 transitions. [2024-10-11 02:36:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:27,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2024-10-11 02:36:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:27,199 INFO L225 Difference]: With dead ends: 1164 [2024-10-11 02:36:27,199 INFO L226 Difference]: Without dead ends: 691 [2024-10-11 02:36:27,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:27,202 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1144 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:27,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 1056 Invalid, 2751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-11 02:36:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 525. [2024-10-11 02:36:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.6990291262135921) internal successors, (700), 433 states have internal predecessors, (700), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:36:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 877 transitions. [2024-10-11 02:36:27,288 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 877 transitions. Word has length 53 [2024-10-11 02:36:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:27,289 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 877 transitions. [2024-10-11 02:36:27,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 877 transitions. [2024-10-11 02:36:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:36:27,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:27,293 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] [2024-10-11 02:36:27,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:36:27,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash -78208260, now seen corresponding path program 1 times [2024-10-11 02:36:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343738421] [2024-10-11 02:36:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:36:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,913 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-11 02:36:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343738421] [2024-10-11 02:36:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343738421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693516010] [2024-10-11 02:36:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:27,915 INFO L87 Difference]: Start difference. First operand 525 states and 877 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:36:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:33,374 INFO L93 Difference]: Finished difference Result 1170 states and 1985 transitions. [2024-10-11 02:36:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:36:33,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2024-10-11 02:36:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:33,381 INFO L225 Difference]: With dead ends: 1170 [2024-10-11 02:36:33,381 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:36:33,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:36:33,384 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 735 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 4835 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 4956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 4835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:33,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1927 Invalid, 4956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 4835 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:36:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:36:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 537. [2024-10-11 02:36:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6959619952494063) internal successors, (714), 444 states have internal predecessors, (714), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-11 02:36:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 895 transitions. [2024-10-11 02:36:33,473 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 895 transitions. Word has length 54 [2024-10-11 02:36:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:33,474 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 895 transitions. [2024-10-11 02:36:33,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:36:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 895 transitions. [2024-10-11 02:36:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:36:33,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:33,476 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] [2024-10-11 02:36:33,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:36:33,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:33,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash -526904899, now seen corresponding path program 1 times [2024-10-11 02:36:33,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:33,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790764016] [2024-10-11 02:36:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:33,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:36:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,961 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-11 02:36:33,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:33,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790764016] [2024-10-11 02:36:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790764016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:33,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:33,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500185273] [2024-10-11 02:36:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:33,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:33,977 INFO L87 Difference]: Start difference. First operand 537 states and 895 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:37,505 INFO L93 Difference]: Finished difference Result 1192 states and 2023 transitions. [2024-10-11 02:36:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:37,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2024-10-11 02:36:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:37,510 INFO L225 Difference]: With dead ends: 1192 [2024-10-11 02:36:37,510 INFO L226 Difference]: Without dead ends: 711 [2024-10-11 02:36:37,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:37,513 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 717 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:37,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1031 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2605 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:36:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-11 02:36:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 537. [2024-10-11 02:36:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6840855106888362) internal successors, (709), 444 states have internal predecessors, (709), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-11 02:36:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 890 transitions. [2024-10-11 02:36:37,602 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 890 transitions. Word has length 54 [2024-10-11 02:36:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:37,602 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 890 transitions. [2024-10-11 02:36:37,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 890 transitions. [2024-10-11 02:36:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:36:37,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:37,604 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] [2024-10-11 02:36:37,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:36:37,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:37,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash -840479970, now seen corresponding path program 1 times [2024-10-11 02:36:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212574142] [2024-10-11 02:36:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:37,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:38,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:38,234 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-11 02:36:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212574142] [2024-10-11 02:36:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212574142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220793075] [2024-10-11 02:36:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:38,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:38,236 INFO L87 Difference]: Start difference. First operand 537 states and 890 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:36:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:43,297 INFO L93 Difference]: Finished difference Result 1172 states and 1981 transitions. [2024-10-11 02:36:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:36:43,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2024-10-11 02:36:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:43,303 INFO L225 Difference]: With dead ends: 1172 [2024-10-11 02:36:43,303 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:36:43,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:43,306 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 708 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 4736 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 4858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 4736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:43,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1870 Invalid, 4858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 4736 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:36:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:36:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 537. [2024-10-11 02:36:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6817102137767221) internal successors, (708), 444 states have internal predecessors, (708), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-11 02:36:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 889 transitions. [2024-10-11 02:36:43,391 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 889 transitions. Word has length 55 [2024-10-11 02:36:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:43,391 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 889 transitions. [2024-10-11 02:36:43,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:36:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 889 transitions. [2024-10-11 02:36:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:36:43,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:43,393 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] [2024-10-11 02:36:43,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:36:43,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:43,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1650034750, now seen corresponding path program 1 times [2024-10-11 02:36:43,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:43,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804788354] [2024-10-11 02:36:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:43,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804788354] [2024-10-11 02:36:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804788354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231687078] [2024-10-11 02:36:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:43,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:43,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:43,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:43,917 INFO L87 Difference]: Start difference. First operand 537 states and 889 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:47,089 INFO L93 Difference]: Finished difference Result 1192 states and 2014 transitions. [2024-10-11 02:36:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2024-10-11 02:36:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:47,093 INFO L225 Difference]: With dead ends: 1192 [2024-10-11 02:36:47,093 INFO L226 Difference]: Without dead ends: 711 [2024-10-11 02:36:47,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:47,096 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1142 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:47,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1045 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:36:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-11 02:36:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 537. [2024-10-11 02:36:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.669833729216152) internal successors, (703), 444 states have internal predecessors, (703), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-11 02:36:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 884 transitions. [2024-10-11 02:36:47,186 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 884 transitions. Word has length 55 [2024-10-11 02:36:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:47,186 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 884 transitions. [2024-10-11 02:36:47,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 884 transitions. [2024-10-11 02:36:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:36:47,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:47,188 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] [2024-10-11 02:36:47,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:36:47,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash -530432422, now seen corresponding path program 1 times [2024-10-11 02:36:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872189123] [2024-10-11 02:36:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:47,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:47,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:47,733 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-11 02:36:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872189123] [2024-10-11 02:36:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872189123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552852354] [2024-10-11 02:36:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:47,735 INFO L87 Difference]: Start difference. First operand 537 states and 884 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:36:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:52,510 INFO L93 Difference]: Finished difference Result 1180 states and 1984 transitions. [2024-10-11 02:36:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:36:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2024-10-11 02:36:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:52,514 INFO L225 Difference]: With dead ends: 1180 [2024-10-11 02:36:52,514 INFO L226 Difference]: Without dead ends: 711 [2024-10-11 02:36:52,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:52,517 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1128 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 4555 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 4810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 4555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:52,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1882 Invalid, 4810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 4555 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:36:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-11 02:36:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 540. [2024-10-11 02:36:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 424 states have (on average 1.6627358490566038) internal successors, (705), 447 states have internal predecessors, (705), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-11 02:36:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 886 transitions. [2024-10-11 02:36:52,623 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 886 transitions. Word has length 56 [2024-10-11 02:36:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 886 transitions. [2024-10-11 02:36:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:36:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 886 transitions. [2024-10-11 02:36:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:36:52,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:52,625 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] [2024-10-11 02:36:52,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:36:52,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1248179832, now seen corresponding path program 1 times [2024-10-11 02:36:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025828916] [2024-10-11 02:36:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:53,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:53,084 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-11 02:36:53,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:53,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025828916] [2024-10-11 02:36:53,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025828916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:53,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:53,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:53,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461989517] [2024-10-11 02:36:53,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:53,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:53,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:53,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:53,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:53,086 INFO L87 Difference]: Start difference. First operand 540 states and 886 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:56,270 INFO L93 Difference]: Finished difference Result 1201 states and 2014 transitions. [2024-10-11 02:36:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2024-10-11 02:36:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:56,275 INFO L225 Difference]: With dead ends: 1201 [2024-10-11 02:36:56,275 INFO L226 Difference]: Without dead ends: 717 [2024-10-11 02:36:56,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:56,277 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1135 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:56,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1066 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:36:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-11 02:36:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 540. [2024-10-11 02:36:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 424 states have (on average 1.650943396226415) internal successors, (700), 447 states have internal predecessors, (700), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-11 02:36:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 881 transitions. [2024-10-11 02:36:56,396 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 881 transitions. Word has length 56 [2024-10-11 02:36:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:56,397 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 881 transitions. [2024-10-11 02:36:56,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:36:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 881 transitions. [2024-10-11 02:36:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:36:56,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:56,398 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] [2024-10-11 02:36:56,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:36:56,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:56,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash -969477639, now seen corresponding path program 1 times [2024-10-11 02:36:56,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:56,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488262949] [2024-10-11 02:36:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:56,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:56,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:56,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:56,929 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-11 02:36:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488262949] [2024-10-11 02:36:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488262949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174085242] [2024-10-11 02:36:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:56,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:56,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:56,931 INFO L87 Difference]: Start difference. First operand 540 states and 881 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:37:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:01,865 INFO L93 Difference]: Finished difference Result 1188 states and 1985 transitions. [2024-10-11 02:37:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:37:01,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-10-11 02:37:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:01,870 INFO L225 Difference]: With dead ends: 1188 [2024-10-11 02:37:01,870 INFO L226 Difference]: Without dead ends: 719 [2024-10-11 02:37:01,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:37:01,873 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 699 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 4765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 4639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:01,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1867 Invalid, 4765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 4639 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:37:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-11 02:37:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 544. [2024-10-11 02:37:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 428 states have (on average 1.6425233644859814) internal successors, (703), 451 states have internal predecessors, (703), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-11 02:37:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 884 transitions. [2024-10-11 02:37:01,963 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 884 transitions. Word has length 57 [2024-10-11 02:37:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:01,964 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 884 transitions. [2024-10-11 02:37:01,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:37:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 884 transitions. [2024-10-11 02:37:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:37:01,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:01,965 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] [2024-10-11 02:37:01,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:37:01,966 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:01,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1786895335, now seen corresponding path program 1 times [2024-10-11 02:37:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194198633] [2024-10-11 02:37:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:37:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:02,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:37:02,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194198633] [2024-10-11 02:37:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194198633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:37:02,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965228802] [2024-10-11 02:37:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:02,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:37:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:02,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:37:02,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:37:02,441 INFO L87 Difference]: Start difference. First operand 544 states and 884 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:37:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:05,955 INFO L93 Difference]: Finished difference Result 1239 states and 2044 transitions. [2024-10-11 02:37:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:37:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2024-10-11 02:37:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:05,961 INFO L225 Difference]: With dead ends: 1239 [2024-10-11 02:37:05,961 INFO L226 Difference]: Without dead ends: 689 [2024-10-11 02:37:05,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:37:05,963 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1077 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:05,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1029 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:37:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-11 02:37:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 526. [2024-10-11 02:37:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6513317191283292) internal successors, (682), 434 states have internal predecessors, (682), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:37:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 859 transitions. [2024-10-11 02:37:06,068 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 859 transitions. Word has length 57 [2024-10-11 02:37:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:06,068 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 859 transitions. [2024-10-11 02:37:06,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:37:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 859 transitions. [2024-10-11 02:37:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:37:06,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:06,069 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] [2024-10-11 02:37:06,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:37:06,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:06,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1139405205, now seen corresponding path program 1 times [2024-10-11 02:37:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:06,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108481142] [2024-10-11 02:37:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:06,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:06,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:06,628 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-11 02:37:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:06,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108481142] [2024-10-11 02:37:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108481142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:06,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:37:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844059834] [2024-10-11 02:37:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:06,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:37:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:37:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:37:06,631 INFO L87 Difference]: Start difference. First operand 526 states and 859 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:37:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:10,061 INFO L93 Difference]: Finished difference Result 1166 states and 1949 transitions. [2024-10-11 02:37:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:37:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2024-10-11 02:37:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:10,067 INFO L225 Difference]: With dead ends: 1166 [2024-10-11 02:37:10,067 INFO L226 Difference]: Without dead ends: 699 [2024-10-11 02:37:10,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:37:10,069 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1091 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:10,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1034 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:37:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-11 02:37:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 531. [2024-10-11 02:37:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.6435406698564594) internal successors, (687), 439 states have internal predecessors, (687), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:37:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 864 transitions. [2024-10-11 02:37:10,178 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 864 transitions. Word has length 58 [2024-10-11 02:37:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:10,178 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 864 transitions. [2024-10-11 02:37:10,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 02:37:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 864 transitions. [2024-10-11 02:37:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:37:10,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:10,179 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] [2024-10-11 02:37:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:37:10,180 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash 434533446, now seen corresponding path program 1 times [2024-10-11 02:37:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054690094] [2024-10-11 02:37:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:37:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,726 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-11 02:37:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054690094] [2024-10-11 02:37:10,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054690094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:10,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:10,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:37:10,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782662806] [2024-10-11 02:37:10,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:10,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:37:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:37:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:37:10,728 INFO L87 Difference]: Start difference. First operand 531 states and 864 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)