./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_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8dba55a6053d72f9111ac5cd147f9f45da0f79494b1facfa57c6480910007fb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:43:28,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:43:28,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:43:28,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:43:28,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:43:28,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:43:28,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:43:28,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:43:28,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:43:28,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:43:28,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:43:28,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:43:28,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:43:28,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:43:28,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:43:28,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:43:28,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:43:28,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:43:28,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:43:28,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:43:28,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:43:28,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:43:28,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:43:28,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:43:28,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:43:28,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:43:28,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:43:28,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:43:28,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:43:28,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:43:28,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:43:28,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:43:28,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:43:28,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:43:28,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:43:28,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:43:28,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:43:28,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:43:28,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:43:28,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:43:28,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:43:28,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:43:28,217 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8dba55a6053d72f9111ac5cd147f9f45da0f79494b1facfa57c6480910007fb [2024-11-19 21:43:28,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:43:28,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:43:28,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:43:28,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:43:28,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:43:28,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c [2024-11-19 21:43:29,753 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:43:30,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:43:30,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c [2024-11-19 21:43:30,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533609e14/20f2a4220c2d470d821ceefa184df4ba/FLAG1bf6b17a4 [2024-11-19 21:43:30,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533609e14/20f2a4220c2d470d821ceefa184df4ba [2024-11-19 21:43:30,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:43:30,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:43:30,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:43:30,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:43:30,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:43:30,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ab5aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30, skipping insertion in model container [2024-11-19 21:43:30,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:43:30,516 WARN L250 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_product31.cil.c[64450,64463] [2024-11-19 21:43:30,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:43:30,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:43:30,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-11-19 21:43:30,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [716] [2024-11-19 21:43:30,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [837] [2024-11-19 21:43:30,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1024] [2024-11-19 21:43:30,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1121] [2024-11-19 21:43:30,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1476] [2024-11-19 21:43:30,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3091] [2024-11-19 21:43:30,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3126] [2024-11-19 21:43:30,586 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3135] [2024-11-19 21:43:30,586 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3501] [2024-11-19 21:43:30,666 WARN L250 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_product31.cil.c[64450,64463] [2024-11-19 21:43:30,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:43:30,700 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:43:30,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30 WrapperNode [2024-11-19 21:43:30,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:43:30,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:43:30,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:43:30,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:43:30,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,765 INFO L138 Inliner]: procedures = 97, calls = 349, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 965 [2024-11-19 21:43:30,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:43:30,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:43:30,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:43:30,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:43:30,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,812 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-11-19 21:43:30,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:43:30,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:43:30,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:43:30,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:43:30,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (1/1) ... [2024-11-19 21:43:30,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:43:30,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:43:30,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:43:30,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:43:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-19 21:43:30,952 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-19 21:43:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-19 21:43:30,952 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-19 21:43:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-19 21:43:30,952 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-19 21:43:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-11-19 21:43:30,953 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-11-19 21:43:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 21:43:30,953 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 21:43:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-19 21:43:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-19 21:43:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-19 21:43:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-19 21:43:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-19 21:43:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-19 21:43:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-19 21:43:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-19 21:43:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-19 21:43:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-19 21:43:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-19 21:43:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-19 21:43:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:43:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-19 21:43:30,956 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-19 21:43:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-19 21:43:30,957 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-19 21:43:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-19 21:43:30,957 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-19 21:43:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-19 21:43:30,957 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-19 21:43:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 21:43:30,957 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 21:43:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-19 21:43:30,957 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-19 21:43:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:43:30,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:43:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-19 21:43:30,958 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-19 21:43:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-19 21:43:30,958 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-19 21:43:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-19 21:43:30,958 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-19 21:43:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-19 21:43:30,958 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-19 21:43:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-19 21:43:30,959 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-19 21:43:30,959 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 21:43:30,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-19 21:43:30,960 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:43:30,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:43:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-19 21:43:30,960 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-19 21:43:31,124 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:43:31,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:43:32,112 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2024-11-19 21:43:32,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:43:32,140 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:43:32,144 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:43:32,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:43:32 BoogieIcfgContainer [2024-11-19 21:43:32,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:43:32,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:43:32,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:43:32,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:43:32,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:43:30" (1/3) ... [2024-11-19 21:43:32,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351c0087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:43:32, skipping insertion in model container [2024-11-19 21:43:32,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:43:30" (2/3) ... [2024-11-19 21:43:32,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351c0087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:43:32, skipping insertion in model container [2024-11-19 21:43:32,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:43:32" (3/3) ... [2024-11-19 21:43:32,150 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2024-11-19 21:43:32,163 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:43:32,163 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:43:32,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:43:32,234 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;@4e67ddd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:43:32,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:43:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 596 states, 466 states have (on average 1.6802575107296138) internal successors, (783), 487 states have internal predecessors, (783), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-19 21:43:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 21:43:32,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:32,268 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:43:32,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:32,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1539098875, now seen corresponding path program 1 times [2024-11-19 21:43:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:32,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062616209] [2024-11-19 21:43:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:32,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:43:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 21:43:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:33,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062616209] [2024-11-19 21:43:33,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062616209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:33,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:33,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367394943] [2024-11-19 21:43:33,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:33,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:33,342 INFO L87 Difference]: Start difference. First operand has 596 states, 466 states have (on average 1.6802575107296138) internal successors, (783), 487 states have internal predecessors, (783), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:38,228 INFO L93 Difference]: Finished difference Result 1433 states and 2411 transitions. [2024-11-19 21:43:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:38,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-11-19 21:43:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:38,258 INFO L225 Difference]: With dead ends: 1433 [2024-11-19 21:43:38,259 INFO L226 Difference]: Without dead ends: 849 [2024-11-19 21:43:38,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:38,273 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1031 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3131 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 3131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:38,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1902 Invalid, 3341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [210 Valid, 3131 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-19 21:43:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-19 21:43:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 588. [2024-11-19 21:43:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 460 states have (on average 1.6760869565217391) internal successors, (771), 479 states have internal predecessors, (771), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 970 transitions. [2024-11-19 21:43:38,473 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 970 transitions. Word has length 104 [2024-11-19 21:43:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:38,474 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 970 transitions. [2024-11-19 21:43:38,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 970 transitions. [2024-11-19 21:43:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 21:43:38,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:38,483 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:43:38,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:43:38,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:38,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash 351124629, now seen corresponding path program 1 times [2024-11-19 21:43:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:38,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360285934] [2024-11-19 21:43:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 21:43:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:39,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:39,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360285934] [2024-11-19 21:43:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360285934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:39,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408416146] [2024-11-19 21:43:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:39,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:39,092 INFO L87 Difference]: Start difference. First operand 588 states and 970 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:43,033 INFO L93 Difference]: Finished difference Result 1419 states and 2373 transitions. [2024-11-19 21:43:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-11-19 21:43:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:43,045 INFO L225 Difference]: With dead ends: 1419 [2024-11-19 21:43:43,045 INFO L226 Difference]: Without dead ends: 849 [2024-11-19 21:43:43,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:43,051 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1504 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:43,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 1794 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 21:43:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-19 21:43:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 588. [2024-11-19 21:43:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 460 states have (on average 1.673913043478261) internal successors, (770), 479 states have internal predecessors, (770), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 969 transitions. [2024-11-19 21:43:43,162 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 969 transitions. Word has length 107 [2024-11-19 21:43:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:43,163 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 969 transitions. [2024-11-19 21:43:43,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 969 transitions. [2024-11-19 21:43:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:43:43,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:43,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:43:43,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:43:43,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:43,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 401682534, now seen corresponding path program 1 times [2024-11-19 21:43:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526503445] [2024-11-19 21:43:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:43:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:43:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:43,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:43,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526503445] [2024-11-19 21:43:43,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526503445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764420459] [2024-11-19 21:43:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:43,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:43,672 INFO L87 Difference]: Start difference. First operand 588 states and 969 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:47,327 INFO L93 Difference]: Finished difference Result 1419 states and 2372 transitions. [2024-11-19 21:43:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:47,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2024-11-19 21:43:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:47,334 INFO L225 Difference]: With dead ends: 1419 [2024-11-19 21:43:47,334 INFO L226 Difference]: Without dead ends: 849 [2024-11-19 21:43:47,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:47,337 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1956 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:47,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 1748 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 21:43:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-19 21:43:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 588. [2024-11-19 21:43:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 460 states have (on average 1.6717391304347826) internal successors, (769), 479 states have internal predecessors, (769), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 968 transitions. [2024-11-19 21:43:47,448 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 968 transitions. Word has length 108 [2024-11-19 21:43:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:47,448 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 968 transitions. [2024-11-19 21:43:47,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 968 transitions. [2024-11-19 21:43:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:43:47,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:47,452 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:43:47,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 21:43:47,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:47,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1268972239, now seen corresponding path program 1 times [2024-11-19 21:43:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085312881] [2024-11-19 21:43:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:43:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:43:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:47,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:47,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085312881] [2024-11-19 21:43:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085312881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:47,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:47,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773545836] [2024-11-19 21:43:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:47,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:47,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:47,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:47,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:47,929 INFO L87 Difference]: Start difference. First operand 588 states and 968 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:51,692 INFO L93 Difference]: Finished difference Result 1419 states and 2371 transitions. [2024-11-19 21:43:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-19 21:43:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:51,697 INFO L225 Difference]: With dead ends: 1419 [2024-11-19 21:43:51,697 INFO L226 Difference]: Without dead ends: 849 [2024-11-19 21:43:51,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:51,700 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 1027 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:51,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1886 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:43:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-19 21:43:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 588. [2024-11-19 21:43:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 460 states have (on average 1.6695652173913043) internal successors, (768), 479 states have internal predecessors, (768), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 967 transitions. [2024-11-19 21:43:51,779 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 967 transitions. Word has length 109 [2024-11-19 21:43:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:51,779 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 967 transitions. [2024-11-19 21:43:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 967 transitions. [2024-11-19 21:43:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:43:51,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:51,782 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:43:51,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 21:43:51,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -462645182, now seen corresponding path program 1 times [2024-11-19 21:43:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469774821] [2024-11-19 21:43:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:43:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:43:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:52,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:52,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469774821] [2024-11-19 21:43:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469774821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:52,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:52,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650954797] [2024-11-19 21:43:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:52,278 INFO L87 Difference]: Start difference. First operand 588 states and 967 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:56,022 INFO L93 Difference]: Finished difference Result 1419 states and 2370 transitions. [2024-11-19 21:43:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:56,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-11-19 21:43:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:56,026 INFO L225 Difference]: With dead ends: 1419 [2024-11-19 21:43:56,027 INFO L226 Difference]: Without dead ends: 849 [2024-11-19 21:43:56,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:56,029 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 1023 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:56,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1872 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 21:43:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-19 21:43:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 588. [2024-11-19 21:43:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 460 states have (on average 1.6673913043478261) internal successors, (767), 479 states have internal predecessors, (767), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 966 transitions. [2024-11-19 21:43:56,129 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 966 transitions. Word has length 110 [2024-11-19 21:43:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:56,129 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 966 transitions. [2024-11-19 21:43:56,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 966 transitions. [2024-11-19 21:43:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:43:56,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:56,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:43:56,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:43:56,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:56,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -179292723, now seen corresponding path program 1 times [2024-11-19 21:43:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:56,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61563976] [2024-11-19 21:43:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:43:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:56,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:56,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61563976] [2024-11-19 21:43:56,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61563976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:56,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:56,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:43:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929628953] [2024-11-19 21:43:56,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:56,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:43:56,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:56,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:43:56,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:43:56,734 INFO L87 Difference]: Start difference. First operand 588 states and 966 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:44:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:02,793 INFO L93 Difference]: Finished difference Result 1396 states and 2320 transitions. [2024-11-19 21:44:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 21:44:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-11-19 21:44:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:02,799 INFO L225 Difference]: With dead ends: 1396 [2024-11-19 21:44:02,799 INFO L226 Difference]: Without dead ends: 875 [2024-11-19 21:44:02,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:44:02,803 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 1127 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 7379 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 4165 SdHoareTripleChecker+Invalid, 7594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 7379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:02,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 4165 Invalid, 7594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [215 Valid, 7379 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 21:44:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-19 21:44:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 601. [2024-11-19 21:44:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 470 states have (on average 1.6638297872340426) internal successors, (782), 491 states have internal predecessors, (782), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 985 transitions. [2024-11-19 21:44:02,894 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 985 transitions. Word has length 111 [2024-11-19 21:44:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:02,894 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 985 transitions. [2024-11-19 21:44:02,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:44:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 985 transitions. [2024-11-19 21:44:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:44:02,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:02,899 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:02,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:44:02,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:02,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash -988780180, now seen corresponding path program 1 times [2024-11-19 21:44:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:02,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500468818] [2024-11-19 21:44:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:44:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500468818] [2024-11-19 21:44:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500468818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247334571] [2024-11-19 21:44:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:03,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:03,368 INFO L87 Difference]: Start difference. First operand 601 states and 985 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:07,292 INFO L93 Difference]: Finished difference Result 1422 states and 2362 transitions. [2024-11-19 21:44:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:44:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-19 21:44:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:07,297 INFO L225 Difference]: With dead ends: 1422 [2024-11-19 21:44:07,297 INFO L226 Difference]: Without dead ends: 883 [2024-11-19 21:44:07,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:44:07,301 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1097 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:07,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1861 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 3094 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 21:44:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-19 21:44:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 601. [2024-11-19 21:44:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 470 states have (on average 1.6531914893617021) internal successors, (777), 491 states have internal predecessors, (777), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 980 transitions. [2024-11-19 21:44:07,396 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 980 transitions. Word has length 111 [2024-11-19 21:44:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:07,397 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 980 transitions. [2024-11-19 21:44:07,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 980 transitions. [2024-11-19 21:44:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:44:07,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:07,400 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:07,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:44:07,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:07,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1967457661, now seen corresponding path program 1 times [2024-11-19 21:44:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643302649] [2024-11-19 21:44:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:44:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643302649] [2024-11-19 21:44:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643302649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011262624] [2024-11-19 21:44:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:07,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:07,923 INFO L87 Difference]: Start difference. First operand 601 states and 980 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:11,776 INFO L93 Difference]: Finished difference Result 1422 states and 2357 transitions. [2024-11-19 21:44:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:44:11,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2024-11-19 21:44:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:11,780 INFO L225 Difference]: With dead ends: 1422 [2024-11-19 21:44:11,780 INFO L226 Difference]: Without dead ends: 883 [2024-11-19 21:44:11,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:44:11,782 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1093 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 3068 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 3068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:11,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1869 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 3068 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 21:44:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-19 21:44:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 601. [2024-11-19 21:44:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 470 states have (on average 1.6425531914893616) internal successors, (772), 491 states have internal predecessors, (772), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 975 transitions. [2024-11-19 21:44:11,872 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 975 transitions. Word has length 112 [2024-11-19 21:44:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:11,872 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 975 transitions. [2024-11-19 21:44:11,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 975 transitions. [2024-11-19 21:44:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:44:11,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:11,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:44:11,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1559895407, now seen corresponding path program 1 times [2024-11-19 21:44:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:11,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368190444] [2024-11-19 21:44:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:44:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368190444] [2024-11-19 21:44:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368190444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:12,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:12,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849725260] [2024-11-19 21:44:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:12,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:12,382 INFO L87 Difference]: Start difference. First operand 601 states and 975 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:16,229 INFO L93 Difference]: Finished difference Result 1422 states and 2352 transitions. [2024-11-19 21:44:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:44:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-11-19 21:44:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:16,234 INFO L225 Difference]: With dead ends: 1422 [2024-11-19 21:44:16,234 INFO L226 Difference]: Without dead ends: 883 [2024-11-19 21:44:16,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:44:16,237 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 1092 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 3043 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 3043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:16,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1872 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 21:44:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-19 21:44:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 601. [2024-11-19 21:44:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 470 states have (on average 1.6319148936170214) internal successors, (767), 491 states have internal predecessors, (767), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 970 transitions. [2024-11-19 21:44:16,351 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 970 transitions. Word has length 113 [2024-11-19 21:44:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:16,351 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 970 transitions. [2024-11-19 21:44:16,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 970 transitions. [2024-11-19 21:44:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:44:16,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:16,354 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:16,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:44:16,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1655596120, now seen corresponding path program 1 times [2024-11-19 21:44:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590969069] [2024-11-19 21:44:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:44:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:16,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:16,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590969069] [2024-11-19 21:44:16,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590969069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:16,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:16,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:16,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829363614] [2024-11-19 21:44:16,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:16,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:16,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:16,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:16,831 INFO L87 Difference]: Start difference. First operand 601 states and 970 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:20,405 INFO L93 Difference]: Finished difference Result 1395 states and 2303 transitions. [2024-11-19 21:44:20,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:44:20,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-11-19 21:44:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:20,410 INFO L225 Difference]: With dead ends: 1395 [2024-11-19 21:44:20,410 INFO L226 Difference]: Without dead ends: 871 [2024-11-19 21:44:20,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:44:20,411 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1995 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:20,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 1734 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:44:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-19 21:44:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 601. [2024-11-19 21:44:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 470 states have (on average 1.6297872340425532) internal successors, (766), 491 states have internal predecessors, (766), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 969 transitions. [2024-11-19 21:44:20,508 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 969 transitions. Word has length 114 [2024-11-19 21:44:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:20,508 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 969 transitions. [2024-11-19 21:44:20,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 969 transitions. [2024-11-19 21:44:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:44:20,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:20,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:44:20,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1128574328, now seen corresponding path program 1 times [2024-11-19 21:44:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183269514] [2024-11-19 21:44:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:44:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:20,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:20,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183269514] [2024-11-19 21:44:20,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183269514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:20,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436053434] [2024-11-19 21:44:20,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:20,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:20,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:20,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:20,931 INFO L87 Difference]: Start difference. First operand 601 states and 969 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:24,308 INFO L93 Difference]: Finished difference Result 1422 states and 2343 transitions. [2024-11-19 21:44:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:44:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-11-19 21:44:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:24,315 INFO L225 Difference]: With dead ends: 1422 [2024-11-19 21:44:24,315 INFO L226 Difference]: Without dead ends: 883 [2024-11-19 21:44:24,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:44:24,317 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1560 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:24,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 1796 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:44:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-19 21:44:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 601. [2024-11-19 21:44:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 470 states have (on average 1.6191489361702127) internal successors, (761), 491 states have internal predecessors, (761), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 964 transitions. [2024-11-19 21:44:24,429 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 964 transitions. Word has length 114 [2024-11-19 21:44:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:24,429 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 964 transitions. [2024-11-19 21:44:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 964 transitions. [2024-11-19 21:44:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:44:24,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:24,432 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:24,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:44:24,432 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:24,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1108944620, now seen corresponding path program 1 times [2024-11-19 21:44:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:24,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280843696] [2024-11-19 21:44:24,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:24,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:44:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280843696] [2024-11-19 21:44:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280843696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:24,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:44:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671668797] [2024-11-19 21:44:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:44:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:44:24,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:44:24,898 INFO L87 Difference]: Start difference. First operand 601 states and 964 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:44:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:29,719 INFO L93 Difference]: Finished difference Result 1408 states and 2311 transitions. [2024-11-19 21:44:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:44:29,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-19 21:44:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:29,726 INFO L225 Difference]: With dead ends: 1408 [2024-11-19 21:44:29,726 INFO L226 Difference]: Without dead ends: 881 [2024-11-19 21:44:29,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-19 21:44:29,728 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 1056 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 5381 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 5595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 5381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:29,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 3245 Invalid, 5595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 5381 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 21:44:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-19 21:44:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 604. [2024-11-19 21:44:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 473 states have (on average 1.613107822410148) internal successors, (763), 494 states have internal predecessors, (763), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 966 transitions. [2024-11-19 21:44:29,844 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 966 transitions. Word has length 115 [2024-11-19 21:44:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:29,844 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 966 transitions. [2024-11-19 21:44:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:44:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 966 transitions. [2024-11-19 21:44:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:44:29,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:29,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:29,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:44:29,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash 39270326, now seen corresponding path program 1 times [2024-11-19 21:44:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019434826] [2024-11-19 21:44:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:29,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:44:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019434826] [2024-11-19 21:44:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019434826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470204962] [2024-11-19 21:44:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:30,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:30,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:30,267 INFO L87 Difference]: Start difference. First operand 604 states and 966 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:33,924 INFO L93 Difference]: Finished difference Result 1431 states and 2343 transitions. [2024-11-19 21:44:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:44:33,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-11-19 21:44:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:33,929 INFO L225 Difference]: With dead ends: 1431 [2024-11-19 21:44:33,929 INFO L226 Difference]: Without dead ends: 889 [2024-11-19 21:44:33,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:44:33,931 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1079 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 2973 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:33,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1858 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2973 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:44:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-19 21:44:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 604. [2024-11-19 21:44:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 473 states have (on average 1.602536997885835) internal successors, (758), 494 states have internal predecessors, (758), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 961 transitions. [2024-11-19 21:44:34,060 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 961 transitions. Word has length 115 [2024-11-19 21:44:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:34,060 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 961 transitions. [2024-11-19 21:44:34,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 961 transitions. [2024-11-19 21:44:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:44:34,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:34,063 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:34,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:44:34,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:34,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1201106093, now seen corresponding path program 1 times [2024-11-19 21:44:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556740293] [2024-11-19 21:44:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:44:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556740293] [2024-11-19 21:44:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556740293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:34,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934745038] [2024-11-19 21:44:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:34,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:34,536 INFO L87 Difference]: Start difference. First operand 604 states and 961 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:38,061 INFO L93 Difference]: Finished difference Result 1412 states and 2308 transitions. [2024-11-19 21:44:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:44:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-11-19 21:44:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:38,065 INFO L225 Difference]: With dead ends: 1412 [2024-11-19 21:44:38,066 INFO L226 Difference]: Without dead ends: 885 [2024-11-19 21:44:38,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:44:38,067 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1514 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:38,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 1794 Invalid, 3157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:44:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-19 21:44:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 608. [2024-11-19 21:44:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 477 states have (on average 1.5953878406708595) internal successors, (761), 498 states have internal predecessors, (761), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:44:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 964 transitions. [2024-11-19 21:44:38,197 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 964 transitions. Word has length 116 [2024-11-19 21:44:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:38,197 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 964 transitions. [2024-11-19 21:44:38,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 964 transitions. [2024-11-19 21:44:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:44:38,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:38,199 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:38,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:44:38,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:38,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1730457971, now seen corresponding path program 1 times [2024-11-19 21:44:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468661162] [2024-11-19 21:44:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:44:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:38,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:38,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468661162] [2024-11-19 21:44:38,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468661162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:38,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:38,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321132364] [2024-11-19 21:44:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:38,610 INFO L87 Difference]: Start difference. First operand 608 states and 964 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:42,394 INFO L93 Difference]: Finished difference Result 1467 states and 2371 transitions. [2024-11-19 21:44:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:44:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-11-19 21:44:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:42,398 INFO L225 Difference]: With dead ends: 1467 [2024-11-19 21:44:42,398 INFO L226 Difference]: Without dead ends: 857 [2024-11-19 21:44:42,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:44:42,400 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 998 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:42,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1869 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:44:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-19 21:44:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 589. [2024-11-19 21:44:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 461 states have (on average 1.6030368763557483) internal successors, (739), 480 states have internal predecessors, (739), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:44:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 938 transitions. [2024-11-19 21:44:42,499 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 938 transitions. Word has length 116 [2024-11-19 21:44:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:42,499 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 938 transitions. [2024-11-19 21:44:42,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 938 transitions. [2024-11-19 21:44:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 21:44:42,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:42,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:42,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:44:42,502 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:42,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1953009735, now seen corresponding path program 1 times [2024-11-19 21:44:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116508519] [2024-11-19 21:44:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:44:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:42,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116508519] [2024-11-19 21:44:42,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116508519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:42,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:44:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853782109] [2024-11-19 21:44:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:42,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:44:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:44:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:44:42,942 INFO L87 Difference]: Start difference. First operand 589 states and 938 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:44:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:47,807 INFO L93 Difference]: Finished difference Result 1391 states and 2273 transitions. [2024-11-19 21:44:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:44:47,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-11-19 21:44:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:47,812 INFO L225 Difference]: With dead ends: 1391 [2024-11-19 21:44:47,812 INFO L226 Difference]: Without dead ends: 867 [2024-11-19 21:44:47,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-19 21:44:47,814 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1022 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 5271 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 5485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 5271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:47,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 3262 Invalid, 5485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 5271 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 21:44:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-19 21:44:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 594. [2024-11-19 21:44:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 466 states have (on average 1.5965665236051503) internal successors, (744), 485 states have internal predecessors, (744), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:44:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 943 transitions. [2024-11-19 21:44:47,934 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 943 transitions. Word has length 117 [2024-11-19 21:44:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 943 transitions. [2024-11-19 21:44:47,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:44:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 943 transitions. [2024-11-19 21:44:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 21:44:47,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:47,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:47,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:44:47,936 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:47,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2048301696, now seen corresponding path program 1 times [2024-11-19 21:44:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513238513] [2024-11-19 21:44:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:44:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513238513] [2024-11-19 21:44:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513238513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179791140] [2024-11-19 21:44:48,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:48,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:48,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:48,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:48,333 INFO L87 Difference]: Start difference. First operand 594 states and 943 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:44:52,060 INFO L93 Difference]: Finished difference Result 1403 states and 2284 transitions. [2024-11-19 21:44:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:44:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-19 21:44:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:44:52,064 INFO L225 Difference]: With dead ends: 1403 [2024-11-19 21:44:52,064 INFO L226 Difference]: Without dead ends: 858 [2024-11-19 21:44:52,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:44:52,066 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1036 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:44:52,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1858 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2921 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 21:44:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2024-11-19 21:44:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 594. [2024-11-19 21:44:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 466 states have (on average 1.5879828326180256) internal successors, (740), 485 states have internal predecessors, (740), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:44:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 939 transitions. [2024-11-19 21:44:52,174 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 939 transitions. Word has length 118 [2024-11-19 21:44:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:44:52,174 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 939 transitions. [2024-11-19 21:44:52,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:44:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 939 transitions. [2024-11-19 21:44:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 21:44:52,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:44:52,177 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 21:44:52,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:44:52,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:44:52,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:44:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607998, now seen corresponding path program 1 times [2024-11-19 21:44:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:44:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859228378] [2024-11-19 21:44:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:44:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:44:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:44:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:44:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:44:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:44:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:44:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:44:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:44:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:44:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:44:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:44:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:44:52,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859228378] [2024-11-19 21:44:52,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859228378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:44:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:44:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:44:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023949941] [2024-11-19 21:44:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:44:52,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:44:52,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:44:52,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:44:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:44:52,637 INFO L87 Difference]: Start difference. First operand 594 states and 939 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)