./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:24:54,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:24:54,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:24:54,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:24:54,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:24:54,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:24:54,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:24:54,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:24:54,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:24:54,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:24:54,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:24:54,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:24:54,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:24:54,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:24:54,888 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:24:54,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:24:54,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:24:54,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:24:54,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:24:54,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:24:54,891 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 [2024-11-06 23:24:55,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:24:55,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:24:55,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:24:55,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:24:55,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:24:55,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2024-11-06 23:24:56,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:24:56,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:24:56,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2024-11-06 23:24:56,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f75cbf467/b1f1a8a0e77943e7888d390c8b58e219/FLAG239f96d3e [2024-11-06 23:24:56,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f75cbf467/b1f1a8a0e77943e7888d390c8b58e219 [2024-11-06 23:24:56,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:24:56,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:24:56,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:24:56,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:24:56,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:24:56,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:24:56" (1/1) ... [2024-11-06 23:24:57,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb3b173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:56, skipping insertion in model container [2024-11-06 23:24:57,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:24:56" (1/1) ... [2024-11-06 23:24:57,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:24:57,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2024-11-06 23:24:57,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:24:57,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:24:57,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-11-06 23:24:57,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2024-11-06 23:24:57,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [428] [2024-11-06 23:24:57,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [594] [2024-11-06 23:24:57,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2119] [2024-11-06 23:24:57,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2128] [2024-11-06 23:24:57,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2790] [2024-11-06 23:24:57,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3145] [2024-11-06 23:24:57,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3236] [2024-11-06 23:24:57,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3271] [2024-11-06 23:24:57,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2024-11-06 23:24:57,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:24:57,664 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:24:57,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57 WrapperNode [2024-11-06 23:24:57,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:24:57,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:24:57,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:24:57,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:24:57,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,743 INFO L138 Inliner]: procedures = 93, calls = 337, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 813 [2024-11-06 23:24:57,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:24:57,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:24:57,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:24:57,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:24:57,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,806 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 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-06 23:24:57,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:24:57,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:24:57,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:24:57,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:24:57,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (1/1) ... [2024-11-06 23:24:57,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:24:57,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:24:57,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:24:57,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:24:57,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:24:57,928 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-06 23:24:57,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-06 23:24:57,929 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-06 23:24:57,929 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-06 23:24:57,929 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-06 23:24:57,929 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-06 23:24:57,929 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-06 23:24:57,929 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-06 23:24:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-06 23:24:57,930 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-06 23:24:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-06 23:24:57,930 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-06 23:24:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-06 23:24:57,930 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-06 23:24:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-06 23:24:57,930 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-06 23:24:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-06 23:24:57,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-06 23:24:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-06 23:24:57,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-06 23:24:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-06 23:24:57,932 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-06 23:24:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-06 23:24:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-06 23:24:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-06 23:24:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-06 23:24:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:24:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:24:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-06 23:24:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-06 23:24:58,147 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:24:58,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:24:59,412 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2024-11-06 23:24:59,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:24:59,446 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:24:59,450 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 23:24:59,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:24:59 BoogieIcfgContainer [2024-11-06 23:24:59,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:24:59,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:24:59,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:24:59,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:24:59,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:24:56" (1/3) ... [2024-11-06 23:24:59,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195eab29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:24:59, skipping insertion in model container [2024-11-06 23:24:59,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:24:57" (2/3) ... [2024-11-06 23:24:59,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195eab29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:24:59, skipping insertion in model container [2024-11-06 23:24:59,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:24:59" (3/3) ... [2024-11-06 23:24:59,462 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2024-11-06 23:24:59,474 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:24:59,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:24:59,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:24:59,563 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;@2691117d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:24:59,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:24:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 431 states have (on average 1.7076566125290022) internal successors, (736), 454 states have internal predecessors, (736), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) [2024-11-06 23:24:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:24:59,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:24:59,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:24:59,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:24:59,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:24:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1868940779, now seen corresponding path program 1 times [2024-11-06 23:24:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:24:59,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118019911] [2024-11-06 23:24:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:24:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:24:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 23:25:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-06 23:25:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:00,934 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-06 23:25:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:00,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118019911] [2024-11-06 23:25:00,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118019911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:00,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:00,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625323045] [2024-11-06 23:25:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:00,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:00,966 INFO L87 Difference]: Start difference. First operand has 545 states, 431 states have (on average 1.7076566125290022) internal successors, (736), 454 states have internal predecessors, (736), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:05,806 INFO L93 Difference]: Finished difference Result 1223 states and 2080 transitions. [2024-11-06 23:25:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:25:05,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-06 23:25:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:05,823 INFO L225 Difference]: With dead ends: 1223 [2024-11-06 23:25:05,823 INFO L226 Difference]: Without dead ends: 690 [2024-11-06 23:25:05,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:25:05,834 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 672 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:05,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1157 Invalid, 2786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-06 23:25:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-06 23:25:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-06 23:25:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.703529411764706) internal successors, (724), 446 states have internal predecessors, (724), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-06 23:25:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 897 transitions. [2024-11-06 23:25:06,021 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 897 transitions. Word has length 58 [2024-11-06 23:25:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:06,021 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 897 transitions. [2024-11-06 23:25:06,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 897 transitions. [2024-11-06 23:25:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-06 23:25:06,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:06,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:06,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:25:06,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 49721393, now seen corresponding path program 1 times [2024-11-06 23:25:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230908511] [2024-11-06 23:25:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-06 23:25:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:06,730 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-06 23:25:06,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:06,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230908511] [2024-11-06 23:25:06,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230908511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:06,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21557031] [2024-11-06 23:25:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:06,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:06,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:06,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:06,734 INFO L87 Difference]: Start difference. First operand 537 states and 897 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:10,841 INFO L93 Difference]: Finished difference Result 1209 states and 2046 transitions. [2024-11-06 23:25:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:25:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-11-06 23:25:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:10,848 INFO L225 Difference]: With dead ends: 1209 [2024-11-06 23:25:10,848 INFO L226 Difference]: Without dead ends: 690 [2024-11-06 23:25:10,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-06 23:25:10,851 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 669 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:10,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1108 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-06 23:25:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-06 23:25:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-06 23:25:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.7011764705882353) internal successors, (723), 446 states have internal predecessors, (723), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-06 23:25:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 896 transitions. [2024-11-06 23:25:10,947 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 896 transitions. Word has length 61 [2024-11-06 23:25:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:10,948 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 896 transitions. [2024-11-06 23:25:10,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 896 transitions. [2024-11-06 23:25:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-06 23:25:10,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:10,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:10,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:25:10,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:10,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash -343579, now seen corresponding path program 1 times [2024-11-06 23:25:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471273574] [2024-11-06 23:25:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 23:25:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:25:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:11,500 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-06 23:25:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471273574] [2024-11-06 23:25:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471273574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:11,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035500423] [2024-11-06 23:25:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:11,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:11,503 INFO L87 Difference]: Start difference. First operand 537 states and 896 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:15,181 INFO L93 Difference]: Finished difference Result 1209 states and 2045 transitions. [2024-11-06 23:25:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:25:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-11-06 23:25:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:15,187 INFO L225 Difference]: With dead ends: 1209 [2024-11-06 23:25:15,187 INFO L226 Difference]: Without dead ends: 690 [2024-11-06 23:25:15,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-06 23:25:15,190 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1109 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:15,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1103 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 23:25:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-06 23:25:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-06 23:25:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.6988235294117646) internal successors, (722), 446 states have internal predecessors, (722), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-06 23:25:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 895 transitions. [2024-11-06 23:25:15,287 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 895 transitions. Word has length 62 [2024-11-06 23:25:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:15,287 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 895 transitions. [2024-11-06 23:25:15,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 895 transitions. [2024-11-06 23:25:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-06 23:25:15,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:15,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:25:15,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:15,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1969000915, now seen corresponding path program 1 times [2024-11-06 23:25:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010368796] [2024-11-06 23:25:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:25:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:15,833 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-06 23:25:15,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:15,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010368796] [2024-11-06 23:25:15,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010368796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:15,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:15,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213407323] [2024-11-06 23:25:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:15,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:15,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:15,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:15,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:15,836 INFO L87 Difference]: Start difference. First operand 537 states and 895 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:19,646 INFO L93 Difference]: Finished difference Result 1209 states and 2044 transitions. [2024-11-06 23:25:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:25:19,647 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2024-11-06 23:25:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:19,652 INFO L225 Difference]: With dead ends: 1209 [2024-11-06 23:25:19,652 INFO L226 Difference]: Without dead ends: 690 [2024-11-06 23:25:19,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:25:19,655 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 666 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:19,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1117 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 23:25:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-06 23:25:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-06 23:25:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.6964705882352942) internal successors, (721), 446 states have internal predecessors, (721), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-06 23:25:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 894 transitions. [2024-11-06 23:25:19,724 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 894 transitions. Word has length 63 [2024-11-06 23:25:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:19,725 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 894 transitions. [2024-11-06 23:25:19,725 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 894 transitions. [2024-11-06 23:25:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-06 23:25:19,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:19,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:19,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:25:19,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:19,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1010487905, now seen corresponding path program 1 times [2024-11-06 23:25:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:19,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890044283] [2024-11-06 23:25:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:19,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:25:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:25:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:20,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:20,241 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-06 23:25:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890044283] [2024-11-06 23:25:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890044283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:20,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542699054] [2024-11-06 23:25:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:20,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:20,243 INFO L87 Difference]: Start difference. First operand 537 states and 894 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:23,718 INFO L93 Difference]: Finished difference Result 1209 states and 2043 transitions. [2024-11-06 23:25:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:25:23,718 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2024-11-06 23:25:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:23,722 INFO L225 Difference]: With dead ends: 1209 [2024-11-06 23:25:23,722 INFO L226 Difference]: Without dead ends: 690 [2024-11-06 23:25:23,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:25:23,726 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1107 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:23,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1079 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 23:25:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-06 23:25:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-06 23:25:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.6941176470588235) internal successors, (720), 446 states have internal predecessors, (720), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-06 23:25:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 893 transitions. [2024-11-06 23:25:23,800 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 893 transitions. Word has length 64 [2024-11-06 23:25:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:23,801 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 893 transitions. [2024-11-06 23:25:23,801 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 893 transitions. [2024-11-06 23:25:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 23:25:23,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:23,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:23,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:25:23,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:23,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1531282391, now seen corresponding path program 1 times [2024-11-06 23:25:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537921068] [2024-11-06 23:25:23,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:25:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:24,449 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-06 23:25:24,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537921068] [2024-11-06 23:25:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537921068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 23:25:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93184746] [2024-11-06 23:25:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:24,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 23:25:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:24,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 23:25:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:25:24,451 INFO L87 Difference]: Start difference. First operand 537 states and 893 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:25:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:29,196 INFO L93 Difference]: Finished difference Result 1186 states and 1993 transitions. [2024-11-06 23:25:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:25:29,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-06 23:25:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:29,201 INFO L225 Difference]: With dead ends: 1186 [2024-11-06 23:25:29,201 INFO L226 Difference]: Without dead ends: 716 [2024-11-06 23:25:29,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:25:29,206 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1195 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 4700 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 4942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 4700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:29,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1986 Invalid, 4942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 4700 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 23:25:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-06 23:25:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 550. [2024-11-06 23:25:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6896551724137931) internal successors, (735), 458 states have internal predecessors, (735), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-06 23:25:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 912 transitions. [2024-11-06 23:25:29,307 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 912 transitions. Word has length 65 [2024-11-06 23:25:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:29,308 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 912 transitions. [2024-11-06 23:25:29,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:25:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 912 transitions. [2024-11-06 23:25:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 23:25:29,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:29,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:29,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:25:29,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:29,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash -561701368, now seen corresponding path program 1 times [2024-11-06 23:25:29,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:29,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054323966] [2024-11-06 23:25:29,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:25:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:29,810 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-06 23:25:29,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054323966] [2024-11-06 23:25:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054323966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:29,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:29,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347740887] [2024-11-06 23:25:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:29,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:29,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:29,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:29,812 INFO L87 Difference]: Start difference. First operand 550 states and 912 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:33,121 INFO L93 Difference]: Finished difference Result 1212 states and 2035 transitions. [2024-11-06 23:25:33,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:25:33,122 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-06 23:25:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:33,125 INFO L225 Difference]: With dead ends: 1212 [2024-11-06 23:25:33,125 INFO L226 Difference]: Without dead ends: 724 [2024-11-06 23:25:33,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:25:33,128 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 725 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:33,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1117 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 23:25:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-06 23:25:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-06 23:25:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6781609195402298) internal successors, (730), 458 states have internal predecessors, (730), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-06 23:25:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 907 transitions. [2024-11-06 23:25:33,206 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 907 transitions. Word has length 65 [2024-11-06 23:25:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:33,206 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 907 transitions. [2024-11-06 23:25:33,207 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 907 transitions. [2024-11-06 23:25:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 23:25:33,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:33,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:33,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:25:33,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:33,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1632909725, now seen corresponding path program 1 times [2024-11-06 23:25:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057484442] [2024-11-06 23:25:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-06 23:25:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:33,735 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-06 23:25:33,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:33,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057484442] [2024-11-06 23:25:33,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057484442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:33,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:33,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:33,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391228584] [2024-11-06 23:25:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:33,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:33,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:33,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:33,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:33,736 INFO L87 Difference]: Start difference. First operand 550 states and 907 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:36,960 INFO L93 Difference]: Finished difference Result 1212 states and 2030 transitions. [2024-11-06 23:25:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:25:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-06 23:25:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:36,965 INFO L225 Difference]: With dead ends: 1212 [2024-11-06 23:25:36,965 INFO L226 Difference]: Without dead ends: 724 [2024-11-06 23:25:36,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:25:36,968 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 1168 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:36,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1115 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 23:25:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-06 23:25:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-06 23:25:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6666666666666667) internal successors, (725), 458 states have internal predecessors, (725), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-06 23:25:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 902 transitions. [2024-11-06 23:25:37,057 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 902 transitions. Word has length 66 [2024-11-06 23:25:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:37,057 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 902 transitions. [2024-11-06 23:25:37,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 902 transitions. [2024-11-06 23:25:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:25:37,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:37,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:37,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:25:37,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:37,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:37,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1568997267, now seen corresponding path program 1 times [2024-11-06 23:25:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:37,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031101719] [2024-11-06 23:25:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:37,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-06 23:25:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:37,524 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-06 23:25:37,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:37,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031101719] [2024-11-06 23:25:37,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031101719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:37,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:37,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113057542] [2024-11-06 23:25:37,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:37,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:37,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:37,526 INFO L87 Difference]: Start difference. First operand 550 states and 902 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:41,051 INFO L93 Difference]: Finished difference Result 1212 states and 2025 transitions. [2024-11-06 23:25:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:25:41,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-06 23:25:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:41,056 INFO L225 Difference]: With dead ends: 1212 [2024-11-06 23:25:41,056 INFO L226 Difference]: Without dead ends: 724 [2024-11-06 23:25:41,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:25:41,058 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 722 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:41,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1094 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 23:25:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-06 23:25:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-06 23:25:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6551724137931034) internal successors, (720), 458 states have internal predecessors, (720), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-06 23:25:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 897 transitions. [2024-11-06 23:25:41,155 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 897 transitions. Word has length 67 [2024-11-06 23:25:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:41,155 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 897 transitions. [2024-11-06 23:25:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 897 transitions. [2024-11-06 23:25:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 23:25:41,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:41,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:41,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:25:41,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:41,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1284448200, now seen corresponding path program 1 times [2024-11-06 23:25:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:41,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311551752] [2024-11-06 23:25:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 23:25:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:41,678 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-06 23:25:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:41,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311551752] [2024-11-06 23:25:41,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311551752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:41,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:41,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321882093] [2024-11-06 23:25:41,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:41,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:41,680 INFO L87 Difference]: Start difference. First operand 550 states and 897 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:45,399 INFO L93 Difference]: Finished difference Result 1185 states and 1976 transitions. [2024-11-06 23:25:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 23:25:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-06 23:25:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:45,403 INFO L225 Difference]: With dead ends: 1185 [2024-11-06 23:25:45,404 INFO L226 Difference]: Without dead ends: 712 [2024-11-06 23:25:45,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:25:45,406 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 710 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:45,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1060 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 23:25:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-06 23:25:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 550. [2024-11-06 23:25:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6528735632183909) internal successors, (719), 458 states have internal predecessors, (719), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-06 23:25:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 896 transitions. [2024-11-06 23:25:45,496 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 896 transitions. Word has length 68 [2024-11-06 23:25:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:45,497 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 896 transitions. [2024-11-06 23:25:45,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 896 transitions. [2024-11-06 23:25:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 23:25:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:45,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:45,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 23:25:45,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:45,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -676077912, now seen corresponding path program 1 times [2024-11-06 23:25:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943248411] [2024-11-06 23:25:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 23:25:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:46,030 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-06 23:25:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943248411] [2024-11-06 23:25:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943248411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:46,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701669243] [2024-11-06 23:25:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:46,031 INFO L87 Difference]: Start difference. First operand 550 states and 896 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:48,968 INFO L93 Difference]: Finished difference Result 1212 states and 2016 transitions. [2024-11-06 23:25:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:25:48,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-06 23:25:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:48,972 INFO L225 Difference]: With dead ends: 1212 [2024-11-06 23:25:48,972 INFO L226 Difference]: Without dead ends: 724 [2024-11-06 23:25:48,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:25:48,974 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1171 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:48,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1072 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 23:25:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-06 23:25:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-06 23:25:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6413793103448275) internal successors, (714), 458 states have internal predecessors, (714), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-06 23:25:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 891 transitions. [2024-11-06 23:25:49,067 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 891 transitions. Word has length 68 [2024-11-06 23:25:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:49,067 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 891 transitions. [2024-11-06 23:25:49,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:25:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 891 transitions. [2024-11-06 23:25:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-06 23:25:49,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:49,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:25:49,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 23:25:49,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1924060336, now seen corresponding path program 1 times [2024-11-06 23:25:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:49,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056803823] [2024-11-06 23:25:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:25:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:49,742 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-06 23:25:49,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:49,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056803823] [2024-11-06 23:25:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056803823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:49,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 23:25:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747433467] [2024-11-06 23:25:49,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:49,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 23:25:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 23:25:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-06 23:25:49,744 INFO L87 Difference]: Start difference. First operand 550 states and 891 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:25:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:55,567 INFO L93 Difference]: Finished difference Result 1204 states and 1998 transitions. [2024-11-06 23:25:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 23:25:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2024-11-06 23:25:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:55,571 INFO L225 Difference]: With dead ends: 1204 [2024-11-06 23:25:55,571 INFO L226 Difference]: Without dead ends: 728 [2024-11-06 23:25:55,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-06 23:25:55,573 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 712 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 6752 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 6879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 6752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:55,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 2750 Invalid, 6879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [127 Valid, 6752 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-06 23:25:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-11-06 23:25:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 557. [2024-11-06 23:25:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 441 states have (on average 1.6303854875283448) internal successors, (719), 464 states have internal predecessors, (719), 90 states have call successors, (90), 23 states have call predecessors, (90), 25 states have return successors, (89), 83 states have call predecessors, (89), 85 states have call successors, (89) [2024-11-06 23:25:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 898 transitions. [2024-11-06 23:25:55,655 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 898 transitions. Word has length 69 [2024-11-06 23:25:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:55,655 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 898 transitions. [2024-11-06 23:25:55,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:25:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 898 transitions. [2024-11-06 23:25:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-06 23:25:55,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:55,658 INFO L215 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-06 23:25:55,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 23:25:55,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:55,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash 245127023, now seen corresponding path program 1 times [2024-11-06 23:25:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:55,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066712747] [2024-11-06 23:25:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:25:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 23:25:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:56,116 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-06 23:25:56,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066712747] [2024-11-06 23:25:56,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066712747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:56,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:25:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965458636] [2024-11-06 23:25:56,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:56,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:25:56,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:56,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:25:56,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:25:56,117 INFO L87 Difference]: Start difference. First operand 557 states and 898 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-06 23:25:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:25:59,104 INFO L93 Difference]: Finished difference Result 1231 states and 2029 transitions. [2024-11-06 23:25:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:25:59,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-06 23:25:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:25:59,108 INFO L225 Difference]: With dead ends: 1231 [2024-11-06 23:25:59,108 INFO L226 Difference]: Without dead ends: 736 [2024-11-06 23:25:59,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:25:59,109 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 1166 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:25:59,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1087 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 23:25:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-06 23:25:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 557. [2024-11-06 23:25:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 441 states have (on average 1.619047619047619) internal successors, (714), 464 states have internal predecessors, (714), 90 states have call successors, (90), 23 states have call predecessors, (90), 25 states have return successors, (89), 83 states have call predecessors, (89), 85 states have call successors, (89) [2024-11-06 23:25:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 893 transitions. [2024-11-06 23:25:59,176 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 893 transitions. Word has length 75 [2024-11-06 23:25:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:25:59,176 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 893 transitions. [2024-11-06 23:25:59,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-06 23:25:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 893 transitions. [2024-11-06 23:25:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-06 23:25:59,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:25:59,178 INFO L215 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, 1] [2024-11-06 23:25:59,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 23:25:59,179 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:25:59,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:25:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1929474410, now seen corresponding path program 1 times [2024-11-06 23:25:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:25:59,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570007843] [2024-11-06 23:25:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:25:59,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:25:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:25:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:25:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-06 23:25:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:25:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:25:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 23:25:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:25:59,751 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-06 23:25:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:25:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570007843] [2024-11-06 23:25:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570007843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:25:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:25:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 23:25:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647659120] [2024-11-06 23:25:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:25:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 23:25:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:25:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 23:25:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:25:59,753 INFO L87 Difference]: Start difference. First operand 557 states and 893 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:26:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:26:04,351 INFO L93 Difference]: Finished difference Result 1216 states and 1998 transitions. [2024-11-06 23:26:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 23:26:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-11-06 23:26:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:26:04,356 INFO L225 Difference]: With dead ends: 1216 [2024-11-06 23:26:04,356 INFO L226 Difference]: Without dead ends: 736 [2024-11-06 23:26:04,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:26:04,358 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1149 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:26:04,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1925 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-06 23:26:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-06 23:26:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 561. [2024-11-06 23:26:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.6112359550561797) internal successors, (717), 468 states have internal predecessors, (717), 90 states have call successors, (90), 23 states have call predecessors, (90), 25 states have return successors, (89), 83 states have call predecessors, (89), 85 states have call successors, (89) [2024-11-06 23:26:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 896 transitions. [2024-11-06 23:26:04,437 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 896 transitions. Word has length 76 [2024-11-06 23:26:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:26:04,438 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 896 transitions. [2024-11-06 23:26:04,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:26:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 896 transitions. [2024-11-06 23:26:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-06 23:26:04,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:26:04,440 INFO L215 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, 1] [2024-11-06 23:26:04,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 23:26:04,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:26:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:26:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2083828554, now seen corresponding path program 1 times [2024-11-06 23:26:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:26:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192235146] [2024-11-06 23:26:04,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:26:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:26:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:26:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:26:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-06 23:26:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:26:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 23:26:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:04,915 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-06 23:26:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:26:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192235146] [2024-11-06 23:26:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192235146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:26:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:26:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:26:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266454724] [2024-11-06 23:26:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:26:04,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:26:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:26:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:26:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:26:04,916 INFO L87 Difference]: Start difference. First operand 561 states and 896 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-06 23:26:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:26:08,142 INFO L93 Difference]: Finished difference Result 1267 states and 2057 transitions. [2024-11-06 23:26:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:26:08,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-06 23:26:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:26:08,146 INFO L225 Difference]: With dead ends: 1267 [2024-11-06 23:26:08,146 INFO L226 Difference]: Without dead ends: 704 [2024-11-06 23:26:08,147 INFO L431 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-06 23:26:08,147 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1103 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:26:08,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1046 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 23:26:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-06 23:26:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 542. [2024-11-06 23:26:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.6200466200466201) internal successors, (695), 450 states have internal predecessors, (695), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2024-11-06 23:26:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 870 transitions. [2024-11-06 23:26:08,227 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 870 transitions. Word has length 76 [2024-11-06 23:26:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:26:08,227 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 870 transitions. [2024-11-06 23:26:08,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-06 23:26:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 870 transitions. [2024-11-06 23:26:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-06 23:26:08,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:26:08,229 INFO L215 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, 1, 1] [2024-11-06 23:26:08,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 23:26:08,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:26:08,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:26:08,230 INFO L85 PathProgramCache]: Analyzing trace with hash 715869938, now seen corresponding path program 1 times [2024-11-06 23:26:08,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:26:08,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696520157] [2024-11-06 23:26:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:26:08,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:26:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:26:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:26:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:26:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:26:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 23:26:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:08,805 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-06 23:26:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:26:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696520157] [2024-11-06 23:26:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696520157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:26:08,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:26:08,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 23:26:08,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778523052] [2024-11-06 23:26:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:26:08,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 23:26:08,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:26:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 23:26:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:26:08,806 INFO L87 Difference]: Start difference. First operand 542 states and 870 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:26:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:26:13,534 INFO L93 Difference]: Finished difference Result 1191 states and 1959 transitions. [2024-11-06 23:26:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 23:26:13,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 77 [2024-11-06 23:26:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:26:13,538 INFO L225 Difference]: With dead ends: 1191 [2024-11-06 23:26:13,538 INFO L226 Difference]: Without dead ends: 714 [2024-11-06 23:26:13,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:26:13,540 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 682 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 4546 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 4666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 4546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:26:13,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1906 Invalid, 4666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 4546 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 23:26:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-06 23:26:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 547. [2024-11-06 23:26:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 434 states have (on average 1.6129032258064515) internal successors, (700), 455 states have internal predecessors, (700), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2024-11-06 23:26:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 875 transitions. [2024-11-06 23:26:13,635 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 875 transitions. Word has length 77 [2024-11-06 23:26:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:26:13,635 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 875 transitions. [2024-11-06 23:26:13,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:26:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 875 transitions. [2024-11-06 23:26:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 23:26:13,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:26:13,638 INFO L215 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, 1, 1, 1] [2024-11-06 23:26:13,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 23:26:13,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:26:13,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:26:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash 129943741, now seen corresponding path program 1 times [2024-11-06 23:26:13,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:26:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768233208] [2024-11-06 23:26:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:26:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:26:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:26:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:13,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:26:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 23:26:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:14,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:26:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 23:26:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:14,102 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-06 23:26:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:26:14,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768233208] [2024-11-06 23:26:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768233208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:26:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:26:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:26:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540167917] [2024-11-06 23:26:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:26:14,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:26:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:26:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:26:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:26:14,103 INFO L87 Difference]: Start difference. First operand 547 states and 875 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-06 23:26:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:26:17,520 INFO L93 Difference]: Finished difference Result 1203 states and 1970 transitions. [2024-11-06 23:26:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 23:26:17,520 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 78 [2024-11-06 23:26:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:26:17,524 INFO L225 Difference]: With dead ends: 1203 [2024-11-06 23:26:17,525 INFO L226 Difference]: Without dead ends: 705 [2024-11-06 23:26:17,526 INFO L431 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-06 23:26:17,527 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 699 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:26:17,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1082 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 23:26:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-06 23:26:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 547. [2024-11-06 23:26:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 434 states have (on average 1.6036866359447004) internal successors, (696), 455 states have internal predecessors, (696), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2024-11-06 23:26:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 871 transitions. [2024-11-06 23:26:17,632 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 871 transitions. Word has length 78 [2024-11-06 23:26:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:26:17,633 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 871 transitions. [2024-11-06 23:26:17,633 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-06 23:26:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 871 transitions. [2024-11-06 23:26:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 23:26:17,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:26:17,635 INFO L215 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, 1, 1, 1] [2024-11-06 23:26:17,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 23:26:17,635 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:26:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:26:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1809218305, now seen corresponding path program 1 times [2024-11-06 23:26:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:26:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504800039] [2024-11-06 23:26:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:26:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:26:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:26:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:26:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 23:26:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:18,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:26:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:26:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 23:26:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:26:18,220 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-06 23:26:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:26:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504800039] [2024-11-06 23:26:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504800039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:26:18,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:26:18,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 23:26:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872495486] [2024-11-06 23:26:18,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:26:18,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 23:26:18,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:26:18,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 23:26:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-06 23:26:18,221 INFO L87 Difference]: Start difference. First operand 547 states and 871 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 7 states have internal predecessors, (59), 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)