./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/elevator_spec9_product28.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 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:34:04,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:34:04,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:34:04,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:34:04,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:34:04,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:34:04,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:34:04,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:34:04,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:34:04,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:34:04,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:34:04,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:34:04,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:34:04,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:34:04,102 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:34:04,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:34:04,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:34:04,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:34:04,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:34:04,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:34:04,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:34:04,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:34:04,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:34:04,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:34:04,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:34:04,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:34:04,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:34:04,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:34:04,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:34:04,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:34:04,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:34:04,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:34:04,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:34:04,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:34:04,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:34:04,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:34:04,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:34:04,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:34:04,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:34:04,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:34:04,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:34:04,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:34:04,112 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 -> 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 [2024-11-11 20:34:04,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:34:04,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:34:04,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:34:04,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:34:04,351 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:34:04,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2024-11-11 20:34:05,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:34:05,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:34:05,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2024-11-11 20:34:05,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a896fc9fb/57c8fd35850b4c59afba204783b51cec/FLAG8a4fce4d7 [2024-11-11 20:34:06,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a896fc9fb/57c8fd35850b4c59afba204783b51cec [2024-11-11 20:34:06,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:34:06,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:34:06,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:34:06,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:34:06,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:34:06,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37af1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06, skipping insertion in model container [2024-11-11 20:34:06,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:34:06,556 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_spec9_product28.cil.c[73050,73063] [2024-11-11 20:34:06,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:34:06,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:34:06,582 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-11-11 20:34:06,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [716] [2024-11-11 20:34:06,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [837] [2024-11-11 20:34:06,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [875] [2024-11-11 20:34:06,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2483] [2024-11-11 20:34:06,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [2849] [2024-11-11 20:34:06,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3009] [2024-11-11 20:34:06,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3361] [2024-11-11 20:34:06,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3373] [2024-11-11 20:34:06,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3464] [2024-11-11 20:34:06,679 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_spec9_product28.cil.c[73050,73063] [2024-11-11 20:34:06,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:34:06,709 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:34:06,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06 WrapperNode [2024-11-11 20:34:06,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:34:06,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:34:06,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:34:06,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:34:06,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,783 INFO L138 Inliner]: procedures = 97, calls = 345, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 1130 [2024-11-11 20:34:06,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:34:06,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:34:06,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:34:06,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:34:06,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,825 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-11 20:34:06,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:34:06,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:34:06,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:34:06,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:34:06,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (1/1) ... [2024-11-11 20:34:06,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:34:06,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:06,925 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-11 20:34:06,929 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-11 20:34:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-11 20:34:06,967 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-11 20:34:06,967 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:34:06,967 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:34:06,967 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:34:06,967 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:34:06,967 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:34:06,967 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:34:06,968 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:34:06,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:34:06,968 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:34:06,968 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:34:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-11 20:34:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-11 20:34:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:34:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:34:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:34:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:34:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:34:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-11 20:34:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-11 20:34:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-11 20:34:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-11 20:34:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:34:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:34:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:34:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:34:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-11 20:34:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-11 20:34:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-11 20:34:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-11 20:34:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:34:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:34:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:34:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:34:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-11-11 20:34:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-11-11 20:34:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:34:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:34:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:34:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:34:06,994 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:34:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:34:06,994 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:34:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-11 20:34:06,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:34:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:34:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:34:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:34:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:34:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:34:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:34:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:34:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:34:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:34:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:34:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-11-11 20:34:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-11-11 20:34:07,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:34:07,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:34:08,121 INFO L? ?]: Removed 456 outVars from TransFormulas that were not future-live. [2024-11-11 20:34:08,122 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:34:08,145 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:34:08,145 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:34:08,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:34:08 BoogieIcfgContainer [2024-11-11 20:34:08,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:34:08,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:34:08,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:34:08,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:34:08,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:34:06" (1/3) ... [2024-11-11 20:34:08,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fee3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:34:08, skipping insertion in model container [2024-11-11 20:34:08,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:06" (2/3) ... [2024-11-11 20:34:08,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fee3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:34:08, skipping insertion in model container [2024-11-11 20:34:08,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:34:08" (3/3) ... [2024-11-11 20:34:08,156 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2024-11-11 20:34:08,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:34:08,168 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:34:08,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:34:08,233 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;@60923ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:34:08,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:34:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 573 states, 448 states have (on average 1.6875) internal successors, (756), 471 states have internal predecessors, (756), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-11 20:34:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 20:34:08,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:08,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:08,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2105504779, now seen corresponding path program 1 times [2024-11-11 20:34:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17139122] [2024-11-11 20:34:08,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:34:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17139122] [2024-11-11 20:34:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17139122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:09,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220786992] [2024-11-11 20:34:09,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:09,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:09,360 INFO L87 Difference]: Start difference. First operand has 573 states, 448 states have (on average 1.6875) internal successors, (756), 471 states have internal predecessors, (756), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:13,250 INFO L93 Difference]: Finished difference Result 1280 states and 2154 transitions. [2024-11-11 20:34:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:34:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2024-11-11 20:34:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:13,268 INFO L225 Difference]: With dead ends: 1280 [2024-11-11 20:34:13,268 INFO L226 Difference]: Without dead ends: 719 [2024-11-11 20:34:13,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:13,276 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 1158 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2624 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:13,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1141 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2624 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 20:34:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-11 20:34:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 565. [2024-11-11 20:34:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6832579185520362) internal successors, (744), 463 states have internal predecessors, (744), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:34:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 933 transitions. [2024-11-11 20:34:13,418 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 933 transitions. Word has length 62 [2024-11-11 20:34:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:13,418 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 933 transitions. [2024-11-11 20:34:13,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 933 transitions. [2024-11-11 20:34:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 20:34:13,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:13,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:34:13,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1663681637, now seen corresponding path program 1 times [2024-11-11 20:34:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:13,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53239689] [2024-11-11 20:34:13,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53239689] [2024-11-11 20:34:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53239689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:13,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101220325] [2024-11-11 20:34:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:13,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:13,964 INFO L87 Difference]: Start difference. First operand 565 states and 933 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:17,367 INFO L93 Difference]: Finished difference Result 1266 states and 2120 transitions. [2024-11-11 20:34:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:34:17,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-11-11 20:34:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:17,378 INFO L225 Difference]: With dead ends: 1266 [2024-11-11 20:34:17,378 INFO L226 Difference]: Without dead ends: 719 [2024-11-11 20:34:17,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:17,383 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1153 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:17,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1119 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 20:34:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-11 20:34:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 565. [2024-11-11 20:34:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6809954751131222) internal successors, (743), 463 states have internal predecessors, (743), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:34:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 932 transitions. [2024-11-11 20:34:17,450 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 932 transitions. Word has length 65 [2024-11-11 20:34:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:17,451 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 932 transitions. [2024-11-11 20:34:17,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 932 transitions. [2024-11-11 20:34:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 20:34:17,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:17,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:17,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:34:17,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:17,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash 645158875, now seen corresponding path program 1 times [2024-11-11 20:34:17,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252948763] [2024-11-11 20:34:17,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:34:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:17,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252948763] [2024-11-11 20:34:17,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252948763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:17,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:17,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536103106] [2024-11-11 20:34:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:17,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:17,916 INFO L87 Difference]: Start difference. First operand 565 states and 932 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:20,955 INFO L93 Difference]: Finished difference Result 1266 states and 2119 transitions. [2024-11-11 20:34:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:34:20,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2024-11-11 20:34:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:20,960 INFO L225 Difference]: With dead ends: 1266 [2024-11-11 20:34:20,960 INFO L226 Difference]: Without dead ends: 719 [2024-11-11 20:34:20,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:20,964 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1153 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:20,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1104 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:34:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-11 20:34:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 565. [2024-11-11 20:34:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6787330316742082) internal successors, (742), 463 states have internal predecessors, (742), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:34:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 931 transitions. [2024-11-11 20:34:21,043 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 931 transitions. Word has length 66 [2024-11-11 20:34:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:21,043 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 931 transitions. [2024-11-11 20:34:21,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 931 transitions. [2024-11-11 20:34:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 20:34:21,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:21,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:21,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:34:21,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2082562911, now seen corresponding path program 1 times [2024-11-11 20:34:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139566974] [2024-11-11 20:34:21,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:34:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:34:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:21,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139566974] [2024-11-11 20:34:21,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139566974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:21,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911892040] [2024-11-11 20:34:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:21,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:21,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:21,496 INFO L87 Difference]: Start difference. First operand 565 states and 931 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:24,595 INFO L93 Difference]: Finished difference Result 1266 states and 2118 transitions. [2024-11-11 20:34:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:34:24,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2024-11-11 20:34:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:24,599 INFO L225 Difference]: With dead ends: 1266 [2024-11-11 20:34:24,599 INFO L226 Difference]: Without dead ends: 719 [2024-11-11 20:34:24,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:24,602 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1151 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:24,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1104 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:34:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-11 20:34:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 565. [2024-11-11 20:34:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6764705882352942) internal successors, (741), 463 states have internal predecessors, (741), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:34:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 930 transitions. [2024-11-11 20:34:24,686 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 930 transitions. Word has length 67 [2024-11-11 20:34:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:24,686 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 930 transitions. [2024-11-11 20:34:24,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 930 transitions. [2024-11-11 20:34:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 20:34:24,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:24,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:24,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:34:24,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:24,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1960879593, now seen corresponding path program 1 times [2024-11-11 20:34:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594070212] [2024-11-11 20:34:24,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:34:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:34:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:25,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594070212] [2024-11-11 20:34:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594070212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:25,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:34:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340975463] [2024-11-11 20:34:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:25,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:34:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:34:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:34:25,139 INFO L87 Difference]: Start difference. First operand 565 states and 930 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:29,257 INFO L93 Difference]: Finished difference Result 1272 states and 2131 transitions. [2024-11-11 20:34:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:34:29,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-11-11 20:34:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:29,261 INFO L225 Difference]: With dead ends: 1272 [2024-11-11 20:34:29,262 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:34:29,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:34:29,264 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 690 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 5070 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 5195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 5070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:29,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1955 Invalid, 5195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 5070 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 20:34:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:34:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 569. [2024-11-11 20:34:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 445 states have (on average 1.6696629213483145) internal successors, (743), 466 states have internal predecessors, (743), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2024-11-11 20:34:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 934 transitions. [2024-11-11 20:34:29,322 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 934 transitions. Word has length 68 [2024-11-11 20:34:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 934 transitions. [2024-11-11 20:34:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 934 transitions. [2024-11-11 20:34:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 20:34:29,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:29,323 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:34:29,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:34:29,324 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:29,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1053687398, now seen corresponding path program 1 times [2024-11-11 20:34:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524375806] [2024-11-11 20:34:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:34:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:34:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:34:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524375806] [2024-11-11 20:34:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524375806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 20:34:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894297018] [2024-11-11 20:34:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:29,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:34:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:34:29,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:34:29,914 INFO L87 Difference]: Start difference. First operand 569 states and 934 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 20:34:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:37,100 INFO L93 Difference]: Finished difference Result 1543 states and 2548 transitions. [2024-11-11 20:34:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 20:34:37,100 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2024-11-11 20:34:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:37,106 INFO L225 Difference]: With dead ends: 1543 [2024-11-11 20:34:37,106 INFO L226 Difference]: Without dead ends: 1032 [2024-11-11 20:34:37,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-11-11 20:34:37,108 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 2318 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 10610 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 11137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 10610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:37,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 2962 Invalid, 11137 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [527 Valid, 10610 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-11 20:34:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-11-11 20:34:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 815. [2024-11-11 20:34:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 639 states have (on average 1.6416275430359937) internal successors, (1049), 660 states have internal predecessors, (1049), 135 states have call successors, (135), 39 states have call predecessors, (135), 40 states have return successors, (138), 129 states have call predecessors, (138), 130 states have call successors, (138) [2024-11-11 20:34:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1322 transitions. [2024-11-11 20:34:37,229 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1322 transitions. Word has length 75 [2024-11-11 20:34:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:37,229 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1322 transitions. [2024-11-11 20:34:37,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 20:34:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1322 transitions. [2024-11-11 20:34:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 20:34:37,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:37,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:37,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:34:37,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:37,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1023660297, now seen corresponding path program 1 times [2024-11-11 20:34:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:37,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416692121] [2024-11-11 20:34:37,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:34:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416692121] [2024-11-11 20:34:37,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416692121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:37,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 20:34:37,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722584686] [2024-11-11 20:34:37,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:37,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 20:34:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:37,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 20:34:37,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:34:37,775 INFO L87 Difference]: Start difference. First operand 815 states and 1322 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:34:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:43,417 INFO L93 Difference]: Finished difference Result 1795 states and 2946 transitions. [2024-11-11 20:34:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 20:34:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-11-11 20:34:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:43,424 INFO L225 Difference]: With dead ends: 1795 [2024-11-11 20:34:43,424 INFO L226 Difference]: Without dead ends: 1047 [2024-11-11 20:34:43,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2024-11-11 20:34:43,428 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1301 mSDsluCounter, 2907 mSDsCounter, 0 mSdLazyCounter, 7975 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 3238 SdHoareTripleChecker+Invalid, 8231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 7975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:43,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 3238 Invalid, 8231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [256 Valid, 7975 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-11 20:34:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-11 20:34:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 828. [2024-11-11 20:34:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 649 states have (on average 1.6394453004622496) internal successors, (1064), 672 states have internal predecessors, (1064), 136 states have call successors, (136), 39 states have call predecessors, (136), 42 states have return successors, (141), 130 states have call predecessors, (141), 131 states have call successors, (141) [2024-11-11 20:34:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1341 transitions. [2024-11-11 20:34:43,564 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1341 transitions. Word has length 75 [2024-11-11 20:34:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:43,566 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1341 transitions. [2024-11-11 20:34:43,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:34:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1341 transitions. [2024-11-11 20:34:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 20:34:43,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:43,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:43,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:34:43,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash -906958808, now seen corresponding path program 1 times [2024-11-11 20:34:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:43,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246759011] [2024-11-11 20:34:43,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:34:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246759011] [2024-11-11 20:34:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246759011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:43,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339339365] [2024-11-11 20:34:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:43,922 INFO L87 Difference]: Start difference. First operand 828 states and 1341 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:46,725 INFO L93 Difference]: Finished difference Result 1803 states and 2956 transitions. [2024-11-11 20:34:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:34:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-11-11 20:34:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:46,730 INFO L225 Difference]: With dead ends: 1803 [2024-11-11 20:34:46,730 INFO L226 Difference]: Without dead ends: 1037 [2024-11-11 20:34:46,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:46,733 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1211 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:46,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1124 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:34:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-11 20:34:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 828. [2024-11-11 20:34:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 649 states have (on average 1.6317411402157165) internal successors, (1059), 672 states have internal predecessors, (1059), 136 states have call successors, (136), 39 states have call predecessors, (136), 42 states have return successors, (141), 130 states have call predecessors, (141), 131 states have call successors, (141) [2024-11-11 20:34:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1336 transitions. [2024-11-11 20:34:46,863 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1336 transitions. Word has length 75 [2024-11-11 20:34:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:46,864 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1336 transitions. [2024-11-11 20:34:46,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1336 transitions. [2024-11-11 20:34:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 20:34:46,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:46,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:46,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:34:46,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:46,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash 635775497, now seen corresponding path program 1 times [2024-11-11 20:34:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:46,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975914261] [2024-11-11 20:34:46,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:34:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975914261] [2024-11-11 20:34:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975914261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:47,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157572259] [2024-11-11 20:34:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:47,264 INFO L87 Difference]: Start difference. First operand 828 states and 1336 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:50,219 INFO L93 Difference]: Finished difference Result 1803 states and 2951 transitions. [2024-11-11 20:34:50,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:34:50,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2024-11-11 20:34:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:50,224 INFO L225 Difference]: With dead ends: 1803 [2024-11-11 20:34:50,225 INFO L226 Difference]: Without dead ends: 1037 [2024-11-11 20:34:50,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:50,228 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 747 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:50,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1132 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:34:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-11 20:34:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 828. [2024-11-11 20:34:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 649 states have (on average 1.6240369799691834) internal successors, (1054), 672 states have internal predecessors, (1054), 136 states have call successors, (136), 39 states have call predecessors, (136), 42 states have return successors, (141), 130 states have call predecessors, (141), 131 states have call successors, (141) [2024-11-11 20:34:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1331 transitions. [2024-11-11 20:34:50,345 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1331 transitions. Word has length 76 [2024-11-11 20:34:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:50,346 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1331 transitions. [2024-11-11 20:34:50,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1331 transitions. [2024-11-11 20:34:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 20:34:50,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:50,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:50,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:34:50,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:50,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 13198051, now seen corresponding path program 1 times [2024-11-11 20:34:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:50,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655654192] [2024-11-11 20:34:50,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:50,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655654192] [2024-11-11 20:34:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655654192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:50,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:50,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:50,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547533098] [2024-11-11 20:34:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:50,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:50,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:50,778 INFO L87 Difference]: Start difference. First operand 828 states and 1331 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:53,722 INFO L93 Difference]: Finished difference Result 1803 states and 2946 transitions. [2024-11-11 20:34:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:34:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-11-11 20:34:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:53,727 INFO L225 Difference]: With dead ends: 1803 [2024-11-11 20:34:53,727 INFO L226 Difference]: Without dead ends: 1037 [2024-11-11 20:34:53,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:53,729 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 745 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:53,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1118 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:34:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-11 20:34:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 828. [2024-11-11 20:34:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 649 states have (on average 1.6163328197226503) internal successors, (1049), 672 states have internal predecessors, (1049), 136 states have call successors, (136), 39 states have call predecessors, (136), 42 states have return successors, (141), 130 states have call predecessors, (141), 131 states have call successors, (141) [2024-11-11 20:34:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1326 transitions. [2024-11-11 20:34:53,862 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1326 transitions. Word has length 77 [2024-11-11 20:34:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:53,863 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1326 transitions. [2024-11-11 20:34:53,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1326 transitions. [2024-11-11 20:34:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 20:34:53,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:53,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:53,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:34:53,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:53,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash 121188642, now seen corresponding path program 1 times [2024-11-11 20:34:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:53,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748900900] [2024-11-11 20:34:53,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748900900] [2024-11-11 20:34:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748900900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399617491] [2024-11-11 20:34:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:54,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:54,264 INFO L87 Difference]: Start difference. First operand 828 states and 1326 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:57,256 INFO L93 Difference]: Finished difference Result 1827 states and 2970 transitions. [2024-11-11 20:34:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:34:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-11-11 20:34:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:57,261 INFO L225 Difference]: With dead ends: 1827 [2024-11-11 20:34:57,261 INFO L226 Difference]: Without dead ends: 976 [2024-11-11 20:34:57,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:57,264 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 1140 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:57,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 1085 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:34:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-11 20:34:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 788. [2024-11-11 20:34:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 612 states have (on average 1.6225490196078431) internal successors, (993), 633 states have internal predecessors, (993), 135 states have call successors, (135), 39 states have call predecessors, (135), 40 states have return successors, (138), 129 states have call predecessors, (138), 130 states have call successors, (138) [2024-11-11 20:34:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1266 transitions. [2024-11-11 20:34:57,405 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1266 transitions. Word has length 77 [2024-11-11 20:34:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:57,405 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1266 transitions. [2024-11-11 20:34:57,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:34:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1266 transitions. [2024-11-11 20:34:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 20:34:57,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:57,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:57,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:34:57,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:57,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash -830172898, now seen corresponding path program 1 times [2024-11-11 20:34:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:57,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598274556] [2024-11-11 20:34:57,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:34:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:57,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598274556] [2024-11-11 20:34:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598274556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263486195] [2024-11-11 20:34:57,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:57,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:57,849 INFO L87 Difference]: Start difference. First operand 788 states and 1266 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:35:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:00,849 INFO L93 Difference]: Finished difference Result 1727 states and 2823 transitions. [2024-11-11 20:35:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2024-11-11 20:35:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:00,854 INFO L225 Difference]: With dead ends: 1727 [2024-11-11 20:35:00,854 INFO L226 Difference]: Without dead ends: 976 [2024-11-11 20:35:00,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:35:00,856 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 659 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:00,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1086 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:35:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-11 20:35:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 788. [2024-11-11 20:35:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 612 states have (on average 1.6209150326797386) internal successors, (992), 633 states have internal predecessors, (992), 135 states have call successors, (135), 39 states have call predecessors, (135), 40 states have return successors, (138), 129 states have call predecessors, (138), 130 states have call successors, (138) [2024-11-11 20:35:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1265 transitions. [2024-11-11 20:35:00,989 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1265 transitions. Word has length 79 [2024-11-11 20:35:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:00,989 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1265 transitions. [2024-11-11 20:35:00,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:35:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1265 transitions. [2024-11-11 20:35:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 20:35:00,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:00,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:00,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:35:00,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:00,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash -11057205, now seen corresponding path program 1 times [2024-11-11 20:35:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354265094] [2024-11-11 20:35:00,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:35:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:35:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:35:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:35:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354265094] [2024-11-11 20:35:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354265094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798512675] [2024-11-11 20:35:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:01,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:01,409 INFO L87 Difference]: Start difference. First operand 788 states and 1265 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:35:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:04,158 INFO L93 Difference]: Finished difference Result 1733 states and 2831 transitions. [2024-11-11 20:35:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:35:04,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-11-11 20:35:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:04,163 INFO L225 Difference]: With dead ends: 1733 [2024-11-11 20:35:04,163 INFO L226 Difference]: Without dead ends: 976 [2024-11-11 20:35:04,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:04,165 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 1081 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:04,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 1115 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:35:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-11 20:35:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 788. [2024-11-11 20:35:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 612 states have (on average 1.619281045751634) internal successors, (991), 633 states have internal predecessors, (991), 135 states have call successors, (135), 39 states have call predecessors, (135), 40 states have return successors, (138), 129 states have call predecessors, (138), 130 states have call successors, (138) [2024-11-11 20:35:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1264 transitions. [2024-11-11 20:35:04,285 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1264 transitions. Word has length 80 [2024-11-11 20:35:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:04,285 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1264 transitions. [2024-11-11 20:35:04,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:35:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1264 transitions. [2024-11-11 20:35:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 20:35:04,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:04,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:35:04,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:04,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 923663657, now seen corresponding path program 1 times [2024-11-11 20:35:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296661321] [2024-11-11 20:35:04,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:35:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:35:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:35:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:35:04,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296661321] [2024-11-11 20:35:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296661321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:04,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:04,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:35:04,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735486209] [2024-11-11 20:35:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:04,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:35:04,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:04,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:35:04,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:35:04,875 INFO L87 Difference]: Start difference. First operand 788 states and 1264 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 20:35:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:10,584 INFO L93 Difference]: Finished difference Result 2814 states and 4673 transitions. [2024-11-11 20:35:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:35:10,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2024-11-11 20:35:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:10,593 INFO L225 Difference]: With dead ends: 2814 [2024-11-11 20:35:10,593 INFO L226 Difference]: Without dead ends: 2072 [2024-11-11 20:35:10,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:10,596 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 4172 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 1087 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4258 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 4862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1087 IncrementalHoareTripleChecker+Valid, 3775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:10,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4258 Valid, 1601 Invalid, 4862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1087 Valid, 3775 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-11 20:35:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2024-11-11 20:35:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1539. [2024-11-11 20:35:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1203 states have (on average 1.630091438071488) internal successors, (1961), 1233 states have internal predecessors, (1961), 257 states have call successors, (257), 72 states have call predecessors, (257), 78 states have return successors, (277), 246 states have call predecessors, (277), 252 states have call successors, (277) [2024-11-11 20:35:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2495 transitions. [2024-11-11 20:35:10,866 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2495 transitions. Word has length 81 [2024-11-11 20:35:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:10,867 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2495 transitions. [2024-11-11 20:35:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 20:35:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2495 transitions. [2024-11-11 20:35:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 20:35:10,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:10,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:35:10,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:35:10,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -824116019, now seen corresponding path program 1 times [2024-11-11 20:35:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:10,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761156550] [2024-11-11 20:35:10,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:35:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:35:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:35:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:35:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:35:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761156550] [2024-11-11 20:35:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761156550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 20:35:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708349989] [2024-11-11 20:35:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 20:35:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 20:35:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:35:11,787 INFO L87 Difference]: Start difference. First operand 1539 states and 2495 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 9 states have internal predecessors, (93), 4 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:35:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:18,804 INFO L93 Difference]: Finished difference Result 3612 states and 6118 transitions. [2024-11-11 20:35:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 20:35:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 9 states have internal predecessors, (93), 4 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-11 20:35:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:18,813 INFO L225 Difference]: With dead ends: 3612 [2024-11-11 20:35:18,813 INFO L226 Difference]: Without dead ends: 2118 [2024-11-11 20:35:18,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2024-11-11 20:35:18,818 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 3017 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 8367 mSolverCounterSat, 1059 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3017 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 9426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1059 IncrementalHoareTripleChecker+Valid, 8367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:18,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3017 Valid, 2718 Invalid, 9426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1059 Valid, 8367 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-11 20:35:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2024-11-11 20:35:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1579. [2024-11-11 20:35:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1233 states have (on average 1.6147607461476075) internal successors, (1991), 1259 states have internal predecessors, (1991), 257 states have call successors, (257), 72 states have call predecessors, (257), 88 states have return successors, (355), 258 states have call predecessors, (355), 252 states have call successors, (355) [2024-11-11 20:35:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2603 transitions. [2024-11-11 20:35:19,120 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2603 transitions. Word has length 134 [2024-11-11 20:35:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2603 transitions. [2024-11-11 20:35:19,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 9 states have internal predecessors, (93), 4 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:35:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2603 transitions. [2024-11-11 20:35:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 20:35:19,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:19,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:35:19,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:35:19,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -441227115, now seen corresponding path program 1 times [2024-11-11 20:35:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467808806] [2024-11-11 20:35:19,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:35:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:35:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:35:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:35:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:35:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:35:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:35:19,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:19,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467808806] [2024-11-11 20:35:19,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467808806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:19,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425435072] [2024-11-11 20:35:19,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:19,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:19,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:19,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:35:19,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:35:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1725 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:35:20,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:35:20,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425435072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-11-11 20:35:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976563101] [2024-11-11 20:35:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:35:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:35:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:20,285 INFO L87 Difference]: Start difference. First operand 1579 states and 2603 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 20:35:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:20,750 INFO L93 Difference]: Finished difference Result 3965 states and 6598 transitions. [2024-11-11 20:35:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:35:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-11 20:35:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:20,760 INFO L225 Difference]: With dead ends: 3965 [2024-11-11 20:35:20,760 INFO L226 Difference]: Without dead ends: 2431 [2024-11-11 20:35:20,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:20,765 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 850 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:20,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1789 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:35:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2024-11-11 20:35:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2429. [2024-11-11 20:35:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2429 states, 1892 states have (on average 1.6141649048625792) internal successors, (3054), 1932 states have internal predecessors, (3054), 400 states have call successors, (400), 109 states have call predecessors, (400), 136 states have return successors, (572), 409 states have call predecessors, (572), 395 states have call successors, (572) [2024-11-11 20:35:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 4026 transitions. [2024-11-11 20:35:21,229 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 4026 transitions. Word has length 135 [2024-11-11 20:35:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:21,229 INFO L471 AbstractCegarLoop]: Abstraction has 2429 states and 4026 transitions. [2024-11-11 20:35:21,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 20:35:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 4026 transitions. [2024-11-11 20:35:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 20:35:21,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:21,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:35:21,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:35:21,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 20:35:21,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:21,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -793415904, now seen corresponding path program 1 times [2024-11-11 20:35:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:21,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301341978] [2024-11-11 20:35:21,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:21,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:35:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:35:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:35:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:35:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:35:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:35:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:35:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301341978] [2024-11-11 20:35:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301341978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137765582] [2024-11-11 20:35:22,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:22,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:35:22,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:35:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:22,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:35:22,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:35:22,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137765582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-11-11 20:35:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31548216] [2024-11-11 20:35:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:35:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:22,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:35:22,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:22,507 INFO L87 Difference]: Start difference. First operand 2429 states and 4026 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 20:35:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:23,351 INFO L93 Difference]: Finished difference Result 6517 states and 10918 transitions. [2024-11-11 20:35:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:35:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-11 20:35:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:23,367 INFO L225 Difference]: With dead ends: 6517 [2024-11-11 20:35:23,367 INFO L226 Difference]: Without dead ends: 4133 [2024-11-11 20:35:23,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:23,374 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 849 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:23,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1743 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:35:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2024-11-11 20:35:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4130. [2024-11-11 20:35:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4130 states, 3211 states have (on average 1.6135160386172531) internal successors, (5181), 3279 states have internal predecessors, (5181), 686 states have call successors, (686), 183 states have call predecessors, (686), 232 states have return successors, (1036), 711 states have call predecessors, (1036), 681 states have call successors, (1036) [2024-11-11 20:35:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 6903 transitions. [2024-11-11 20:35:24,155 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 6903 transitions. Word has length 136 [2024-11-11 20:35:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:24,155 INFO L471 AbstractCegarLoop]: Abstraction has 4130 states and 6903 transitions. [2024-11-11 20:35:24,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 20:35:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 6903 transitions. [2024-11-11 20:35:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:35:24,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:24,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:35:24,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:35:24,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 20:35:24,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:24,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1173637431, now seen corresponding path program 1 times [2024-11-11 20:35:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540633397] [2024-11-11 20:35:24,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:35:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:35:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:35:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:35:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:35:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:35:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:35:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540633397] [2024-11-11 20:35:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540633397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973591928] [2024-11-11 20:35:25,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:25,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:25,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:25,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:35:25,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:35:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:25,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:35:25,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:35:25,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:25,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973591928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:25,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:25,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-11-11 20:35:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152067871] [2024-11-11 20:35:25,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:25,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:35:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:35:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:25,470 INFO L87 Difference]: Start difference. First operand 4130 states and 6903 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 20:35:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:26,875 INFO L93 Difference]: Finished difference Result 11622 states and 19702 transitions. [2024-11-11 20:35:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:35:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-11 20:35:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:26,907 INFO L225 Difference]: With dead ends: 11622 [2024-11-11 20:35:26,908 INFO L226 Difference]: Without dead ends: 7537 [2024-11-11 20:35:26,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:26,921 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 848 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:26,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1737 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:35:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7537 states. [2024-11-11 20:35:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7537 to 7533. [2024-11-11 20:35:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7533 states, 5850 states have (on average 1.6124786324786324) internal successors, (9433), 5974 states have internal predecessors, (9433), 1258 states have call successors, (1258), 331 states have call predecessors, (1258), 424 states have return successors, (2060), 1315 states have call predecessors, (2060), 1253 states have call successors, (2060) [2024-11-11 20:35:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7533 states to 7533 states and 12751 transitions. [2024-11-11 20:35:28,570 INFO L78 Accepts]: Start accepts. Automaton has 7533 states and 12751 transitions. Word has length 137 [2024-11-11 20:35:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:28,571 INFO L471 AbstractCegarLoop]: Abstraction has 7533 states and 12751 transitions. [2024-11-11 20:35:28,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 20:35:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7533 states and 12751 transitions. [2024-11-11 20:35:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:35:28,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:28,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:35:28,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:35:28,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 20:35:28,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 577561584, now seen corresponding path program 1 times [2024-11-11 20:35:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589427173] [2024-11-11 20:35:28,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:35:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:35:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:35:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:35:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:35:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 20:35:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589427173] [2024-11-11 20:35:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589427173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 20:35:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929159895] [2024-11-11 20:35:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:29,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 20:35:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 20:35:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:35:29,597 INFO L87 Difference]: Start difference. First operand 7533 states and 12751 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 9 states have internal predecessors, (97), 4 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15)